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

Exercises

Image    1. [20] Draw the BDDs for all 16 Boolean functions f(x1, x2). What are their sizes?

Image    2. [21] Draw a planar dag with sixteen vertices, each of which is the root of one of the 16 BDDs in exercise 1.

3. [16] How many Boolean functions f(x1, . . ., xn) have BDD size 3 or less?

4. [21] Suppose three fields Image have been packed into a 64-bit word x, where V occupies 8 bits and the other two fields occupy 28 bits each. Show that five bitwise ...

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