Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of design automation problems
DAC '80 Proceedings of the 17th Design Automation Conference
VLSI cell placement techniques
ACM Computing Surveys (CSUR)
Synthesis techniques for digital systems design
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Experiments with simulated annealing
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Simulated annealing and combinatorial optimization
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
| Hi-index | 0.00 |
The Circuit Realization Problem has been previously shown to be NP-hard. We develop here several heuristics for the Circuit Realization Problem. These heuristics are locally optimal with respect to a transform and are f(n)-approximation algorithms. Several of the heuristics make use of a Statistical Mechanics technique for thermal equilibrium analysis in producing their solution. In addition, the heuristics are experimentally shown to have quite acceptable behavior.