First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
Buss and Jakob Nordstr¨ om
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
baseline 1polarities
baseline 1representative citing papers
Exponential lower bounds for cutting planes and Res(⊕) on binary clique formulas for random dense graphs, with polynomial randomized communication complexity for falsified clause finding.
citing papers explorer
-
A Resolution-Based Interactive Proof System for UNSAT
First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
-
Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
Exponential lower bounds for cutting planes and Res(⊕) on binary clique formulas for random dense graphs, with polynomial randomized communication complexity for falsified clause finding.