Abstract
While designing computational structures such as VLSI designs and printed circuit boards, a designer has to solve hard problems of assignment and layout. Once a design is finished it is difficult to evaluate its quality. Suppose the designer had no success in the layout of the structure in the available area using the admissible number of metal layers. This means either that the quality of the used CAD is low or that the restrictions are so severe that this problem has no solution at all.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Frumkin, M.A. (1992). The Complexity of VLSI Computations. In: Systolic Computations. Mathematics and Its Applications (Soviet Series), vol 83. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-2514-7_2
Download citation
DOI: https://doi.org/10.1007/978-94-011-2514-7_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5109-5
Online ISBN: 978-94-011-2514-7
eBook Packages: Springer Book Archive