论文信息 - Complexity Theory and Design Automation - 字舞流文

Complexity Theory and Design Automation

Complexity Theory is discussed and its relationship to Physical Design (i.e. Placement/Wiring) and Test Pattern Generation is shown and developed.

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] J. Paul Roth,et al. Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits , 1967, IEEE Trans. Electron. Comput..

[3] William E. Donath,et al. Placement and average interconnection lengths of computer logic , 1979 .

[4] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[5] W. Donath. Equivalence of memory to Random Logic , 1974 .

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Roy L. Russo,et al. On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[8] Thomas W. Williams,et al. A logic design structure for LSI testability , 1977, DAC '77.

[9] William R. Heller,et al. Prediction of wiring space requirements for LSI , 1977, DAC '77.

[10] Oscar H. Ibarra,et al. Polynomially Complete Fault Detection Problems , 1975, IEEE Transactions on Computers.

[11] Akihiko Yamada,et al. Automatic test generation for large digital circuits , 1977, DAC '77.

[12] Füsun Özgüner,et al. 9-V Algorithm for Test Pattern Generation of Combinational Digital Circuits , 1978, IEEE Transactions on Computers.

[13] B. Ting,et al. Via assignment problem in multilayer printed circuit board , 1979 .