Minimum 2CNF Resolution Refutations in Polynomial Time

14 years 5 months ago

We present an algorithm for ﬁnding a smallest Resolution refutation of any 2CNF in polynomial time.

Joshua Buresh-Oppenheim, David G. Mitchell

Polynomial Time | SAT 2007 | Smallest Resolution Refutation |

claim paper

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SAT
Authors	Joshua Buresh-Oppenheim, David G. Mitchell

Comments (0)