Optimal allocation of computational resources in VLSI
- 1 November 1982
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 379-385
- https://doi.org/10.1109/sfcs.1982.32
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On relations between input and communication/computation in VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- A model of computation for VLSI with related complexity resultsPublished by Association for Computing Machinery (ACM) ,1981
- The entropic limitations on VLSI computations(Extended Abstract)Published by Association for Computing Machinery (ACM) ,1981
- Three-Dimensional Integrated CircuitryPublished by Springer Nature ,1981
- Planar Circuit Complexity and The Performance of VLSI Algorithms +Published by Springer Nature ,1981
- Application of separability and independence notions for proving lower bounds of circuit complexityJournal of Mathematical Sciences, 1980
- A combinatorial limit to the computing power of V.L.S.I. circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979