摘要: This paper reviews several problems that arise in the area of design automation. Most of these problems are shown to be NP-hard. Further, it is unlikely that any of these problems can …
core.ac.uk
acm.org
sci-hub.se 参考文章(55)
Michael Randolph Garey, David S. Johnson, Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran CA. ,(1979)
Melvin A. Breuer, Design automation of digital systems ,(1972)
Sartaj Sahni, Concepts in discrete mathematics ,(1981)
Uno R. Kodres, Formulation and Solution of Circuit Card Design Problems through Use of Graph Methods Springer, Boston, MA. pp. 121- 142 ,(1962) , 10.1007/978-1-4899-7311-5_9
A. S. LaPaugh, ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH Massachusetts Institute of Technology. ,(1980)
Michael Randolph Garey, David S. Johnson, A guide to the theory of np-completeness ,(1978)
Alan Siegel, Danny Dolev, The Separation for General Single-Layer Wiring Barriers VLSI Systems and Computations. pp. 143- 152 ,(1981) , 10.1007/978-3-642-68402-9_17
Sartaj Sahni, Ellis Horowitz, Fundamentals of Computer Algorithms ,(1983)
Ronald L. Rivest, Alan E. Baratz, Gary Miller, Provably Good Channel Routing Algorithms VLSI Systems and Computations. pp. 153- 159 ,(1981) , 10.1007/978-3-642-68402-9_18
Douglas Lewin, Computer-Aided Design of Digital Systems ,(1977)