Minimum 2CNF Resolution Refutations in Polynomial Time.

Joshua Buresh-Oppenheim David G. Mitchell

Published in: SAT (2007)

Keyphrases

clause learning
special case
boolean functions
consequence finding
computational complexity
high resolution
low resolution
approximation algorithms
square error
min sum
theorem prover
conjunctive normal form
finite automata
sampling rate
practical problems
learning algorithm
lower bound
search algorithm