First interactive protocol for Davis-Putnam resolution that is competitive with BDD methods for certifying UNSAT.
Trading group theory for randomness
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Affine automata with only rational entries retain the ability to verify benchmark nonregular languages and provide weak verification for all Turing-recognizable languages plus strong verification for ATIME(2^O(n)) and PSPACE languages in Arthur-Merlin systems.
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.
-
Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
Affine automata with only rational entries retain the ability to verify benchmark nonregular languages and provide weak verification for all Turing-recognizable languages plus strong verification for ATIME(2^O(n)) and PSPACE languages in Arthur-Merlin systems.