Proceedings ArticleDOI
Why is ATPG easy
Mukul R. Prasad,Philip Chong,Kurt Keutzer +2 more
- pp 22-28
Reads0
Chats0
TLDR
This work introduces the concept of circuit cut-width and characterize the complexity of ATPG in terms of this property, and provides theoretical and empirical results to argue that an interestingly large class of practical circuits have cut- width characteristics which ensure a provably efficient solution of AtPG on them.Abstract:
Empirical observation shows that practically encountered instances of ATPG are efficiently solvable. However, it has been known for more than two decades that ATPG is an NP-complete problem. This work is one of the first attempts to reconcile these seemingly disparate results. We introduce the concept of circuit cut-width and characterize the complexity of ATPG in terms of this property. We provide theoretical and empirical results to argue that an interestingly large class of practical circuits have cut-width characteristics which ensure a provably efficient solution of ATPG on them.read more
Citations
More filters
Book ChapterDOI
The Quest for Efficient Boolean Satisfiability Solvers
Lintao Zhang,Sharad Malik +1 more
TL;DR: The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical solutions to this problem enable significant practical applications.
Dissertation
Efficient algorithms for clause-learning SAT solvers
TL;DR: This work introduces several new techniques for Boolean constraint propagation that substantially improve solver efficiency and introduces a new decision strategy that outperforms the state of the art in SAT solvers.
BookDOI
Automated Deduction—CADE-18
TL;DR: DAML+OIL is a description logic based ontology language specifically designed for use on the web, and the logical basis of the language means that reasoning services can be provided, both to support ontology design and to make described web resources more accessible to automated processes.
Book ChapterDOI
The Quest for Efficient Boolean Satisfiability Solvers
Lintao Zhang,Sharad Malik +1 more
TL;DR: The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical solutions to this problem enable significant practical applications as mentioned in this paper.
Journal ArticleDOI
Techniques for the creation of digital watermarks in sequential circuit designs
TL;DR: Evidence that no known algorithms for circuit manipulation can be used to efficiently remove or change the watermark is presented and that the process is immune to a variety of other attacks is presented.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Approximation Algorithms for NP-Hard Problems
TL;DR: This book reviews the design techniques for approximation algorithms and the developments in this area since its inception about three decades ago and the "closeness" to optimum that is achievable in polynomial time.
Journal Article
SIS : A System for Sequential Circuit Synthesis
TL;DR: This paper provides an overview of SIS and contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph] manipulation, and synthesis for PGA’s (programmable gate arrays).