O'Reilly logo

Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1 by Donald E. Knuth

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

With these magic transitions the path above corresponds to 1 → 22 → 313 → 133 → 2244 → 31355 → 424466 → 5153577 → 5135577 → 1535577 → 22646688 → 26446688 → 26466688 →26466888; so a1 . . . a6 = 132334.

175. This problem seems to require a different approach from the methods that worked when b0 =. . .= bn – 1 = 1. Suppose we have a BDD base of N nodes including the two sinks Image and Image together with various branches labeled Image, . . ., , and assume that exactly ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required