A Complexity Theory for VLSI

A Complexity Theory for VLSI

The established methodologies for studying computational complexity can be applied to the new problems posed by very large-scale integrated (VLSI) circuits. This thesis develops a ''VLSI model of computation'' and derives upper and lower bounds on the silicon area and time requir...

Full description

Bibliographic Details
Main Author: Thompson, C. D.
Format: Others
Published: Research Showcase @ CMU 1980
Subjects:
Computational complexity
information theory
graph embedding
mesh connections
shuftle-exchange connections
parallel algorithms
sorting
Fourier transformation
VLSI
area-time complexity
Computer Sciences
Online Access:http://repository.cmu.edu/dissertations/343
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1343&context=dissertations

Internet

http://repository.cmu.edu/dissertations/343
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1343&context=dissertations

Similar Items