Published February 1987
| Published
Journal Article
Open
On the Time-Bandwidth Proof in VLSI Complexity
- Creators
- Abu-Mostafa, Yaser S.
Abstract
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.
Additional Information
© 1987 IEEE. Reprinted with permission. Manuscript received July 18, 1985; revised October 15, 1985. This work was supported by the Program in Advanced Technologies (Aerojet, GM, GTE, TRW).Attached Files
Published - ABUieeetc87.pdf
Files
ABUieeetc87.pdf
Files
(485.7 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:b2a00670e81f9a08156bec28d5809224
|
485.7 kB | Preview Download |
Additional details
- Eprint ID
- 7011
- Resolver ID
- CaltechAUTHORS:ABUieeetc87
- Caltech Program in Advanced Technologies
- Created
-
2007-01-05Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field