Bryant, R. E. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. (English) Zbl 1220.68060 IEEE Trans. Comput. 40, No. 2, 205-213 (1991). Cited in 3 ReviewsCited in 61 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 68P05 Data structures 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 68W35 Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) Keywords:lower bounds; complexity; VLSI implementations; graph representations; Boolean functions; integer multiplication; chip area; speed; ordered binary decision diagram; data structure; area-time complexity; computational complexity; digital arithmetic PDF BibTeX XML Cite \textit{R. E. Bryant}, IEEE Trans. Comput. 40, No. 2, 205--213 (1991; Zbl 1220.68060) Full Text: DOI OpenURL Online Encyclopedia of Integer Sequences: Size of the BDD for the hidden weighted bit function, with the variables in their natural ordering. Number of nodes in the BDD for the hidden weighted bit function h_n under the best possible ordering of variables.