The complexity of design automation problems
DAC: Design Automation Conference（1980）
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”.
MoreTranslated text
Key words
guarantee solution,design automation,problem instance,design automation problem,fast approximation algorithm,optimal solution value,fixed relative error,approximation algorithm,np hard,fault detection,machinery,relative error,complexity,computer science,process design,approximation algorithms,very large scale integration
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined