This work comprises two parts: lower bounds and upper bounds in VLSI circuits. The upper bounds are for the sorting problem: the authors describe a large number of constructions for sorting N numbers in the range left bracket 0,M right bracket for the standard VLSI bit model. The lower bounds apply to a variety of problems. Two new techniques are presented for establishing lower bounds on the information flow in VLSI circuits.
|Original language||English (US)|
|Title of host publication||Annual Symposium on Foundations of Computer Science (Proceedings)|
|Number of pages||14|
|State||Published - Dec 1 1985|
|Name||Annual Symposium on Foundations of Computer Science (Proceedings)|
ASJC Scopus subject areas
- Hardware and Architecture