The complexity of design automation problems

Authors:
Sartaj Sahni;Atul Bhatt
Affiliations:
-;-
Venue:
DAC '80 Proceedings of the 17th Design Automation Conference
Year:
1980

Citing 7
Cited 15

Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
P-Complete Approximation Problems

Journal of the ACM (JACM)
An algorithm for minimizing backboard wiring functions

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Some NP-complete geometric problems

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The application of integer programming in design automation

DAC '66 Proceedings of the SHARE design automation project

Boolean comparison by simulation

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A “GGreedy” channel router

25 years of DAC Papers on Twenty-five years of electronic design automation
Automatic synthesis of Boolean equations using programmable array logic

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
VLSI cell placement techniques

ACM Computing Surveys (CSUR)
Simulated annealing and combinatorial optimization

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Automatic placement a review of current techniques (tutorial session)

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Heuristics for the Circuit Realization Problem

DAC '83 Proceedings of the 20th Design Automation Conference
An architecture for application of artificial intelligence to design

DAC '84 Proceedings of the 21st Design Automation Conference
Towards VLSI complexity: The DA algorithm scaling problem: can special DA hardware help?

DAC '82 Proceedings of the 19th Design Automation Conference
A “greedy” channel router

DAC '82 Proceedings of the 19th Design Automation Conference
Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region

EURO-DAC '90 Proceedings of the conference on European design automation
Universal Tests for Detection of Input/Output Stuck-At and Bridging Faults

IEEE Transactions on Computers
Prefabrication and postfabrication architecture exploration for partially reconfigurable VLIW processors

ACM Transactions on Embedded Computing Systems (TECS)
Detection and identification of input/output stuck-at and bridging faults in combinational and sequential VLSI networks by universal tests

Integration, the VLSI Journal
An efficient macro-cell placement algorithm

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 be solved by fast approximation algorithms that guarantee solutions that are always within some fixed relative error of the optimal solution value. This points out the importance of heuristics and other tools to obtain algorithms that perform well on the problem instances of “interest”.