1795 search results - page 3 / 359 » On the Complexity of Circuit Satisfiability |
STOC
2004
ACM
14 years 6 months ago
2004
ACM
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
ASPDAC
2009
ACM
13 years 11 months ago
2009
ACM
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
DATE
2004
IEEE
13 years 10 months ago
2004
IEEE
Advances in Boolean satisfiability solvers have popularized their use in many of today's CAD VLSI challenges. Existing satisfiability solvers operate on a circuit representat...
ASPDAC
2000
ACM
13 years 10 months ago
2000
ACM
We present a satisfiability based multi-clock path analysis method. The method uses propositional satisfiability (SAT) in the detection of multi-clock paths. We show a method to re...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...