The Community for Technology Leaders
Green Image
Issue No. 02 - February (1987 vol. 36)
ISSN: 0018-9340
pp: 239-240
Y.S. Abu-Mostafa , Departments of Electrical Engineering and Computer Science, California Institute of Technology
A subtle fallacy in the original proof [1] that the computation time T is lowerbounded by a factor inversely proportional to the minimum bisection width of a VLSI chip is pointed out. A corrected version of the proof using the idea of conditionally self-delimiting messages is given.
VLSI complexity, Bisected graph, computation time, information theory, lower bounds, self-delimiting

Y. Abu-Mostafa, "On the Time-Bandwidth Proof in VLSI Complexity," in IEEE Transactions on Computers, vol. 36, no. , pp. 239-240, 1987.
95 ms
(Ver 3.3 (11022016))