|
|
A130678
|
|
Number of reduced BDDs (binary decision diagrams) with two nodes on each level except the top.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Can be computed in polynomial time, but probably not "easily".
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Volume 4, to appear as an exercise in Section 7.1.4.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|