News

IEEE22y
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication | IEEE Journals & Magazine | IEEE Xplore
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 (VLSI) ...
IEEE22y
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication | IEEE Journals & Magazine | IEEE Xplore
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 (VLSI) ...