On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

Lower-bound results on Boolean-function complexity under two different models are discussed. The first is an abstraction of tradeoffs between chip area and speed in very-large-scale-integrated (VLS...