1795 search results - page 4 / 359 » On the Complexity of Circuit Satisfiability |
DATE
1999
IEEE
13 years 11 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer