TY - JOUR

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

T2 - IEEE Transactions on Computers

SP - 205

EP - 213

AU - R. Bryant

PY - 1991

KW - lower bounds; complexity; VLSI implementations; graph representations; Boolean functions; integer multiplication; abstraction; chip area; speed; ordered binary decision diagram; data structure; symbolically representing; area-time complexity; integer multiplier; Boolean functions; computational complexity; data structures; digital arithmetic; VLSI.

DO - 10.1109/12.73590

JO - IEEE Transactions on Computers

IS -

SN - 0018-9340

VO - 10.1109/12.73590

VL - 40

JA - IEEE Transactions on Computers

Y1 - February 1991

ER -