91 search results - page 2 / 19 » On the Polynomial Transparency of Resolution |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
CADE
2001
Springer
14 years 5 months ago
2001
Springer
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
ASPDAC
2010
ACM
13 years 3 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each vertex, v, equal to 2/d(v). We show:
AMAI
2005
Springer
13 years 5 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...