On Notions of Information Transfer in VLSI Circuits


Several papers have recently dealt with techniques for proving area-time lower bounds for VLSI computation by &#8220;crossing sequence&#8221; methods. A number of natural questions are raised by these definitions. 1.<italic>Is the fooling set approach the most powerful way to get information-transfer-based lower bounds?</italic> We shall show it is not… (More)
DOI: 10.1145/800061.808742


3 Figures and Tables

Cite this paper

@inproceedings{Aho1983OnNO, title={On Notions of Information Transfer in VLSI Circuits}, author={Alfred V. Aho and Jeffrey D. Ullman and Mihalis Yannakakis}, booktitle={STOC}, year={1983} }