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...
Main Author: | Thompson, C. D. |
---|---|
Format: | Others |
Published: |
Research Showcase @ CMU
1980
|
Subjects: | |
Online Access: | http://repository.cmu.edu/dissertations/343 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1343&context=dissertations |
Similar Items
-
Realizable paths and the NL vs L problem
by: Prasad, Kintali Shiva
Published: (2012) -
Algorithms for VLSI Circuit Optimization and GPU-Based Parallelization
by: Liu, Yifang
Published: (2010) -
Engineering Bi-Connected Component Overlay for Maximum-Flow Parallel Acceleration in Large Sparse Graph
Published: (2018-10-01) -
Some Structures of Parallel VLSI-Oriented Processing Units for Implementation of Small Size Discrete Fractional Fourier Transforms
by: Aleksandr Cariow, et al.
Published: (2019-05-01) -
Computational complexity: Time and space
by: George Palace T., et al.
Published: (2018-06-01)