Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SAT
2007
Springer

favoriteEmaildiscussreport

129views Hardware» more SAT 2007»

Minimum 2CNF Resolution Refutations in Polynomial Time

13 years 10 months ago

Minimum 2CNF Resolution Refutations in Polynomial Time

Download www.cs.sfu.ca

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

Joshua Buresh-Oppenheim, David G. Mitchell

Real-time Traffic

Polynomial Time | SAT 2007 | Smallest Resolution Refutation |

claim paper

Related Content

» Resolution on Quantified Generalized Clausesets

» NPCompleteness of Refutability by LiteralOnce Resolution

» A combinatorial characterization of resolution width

» MeanPayoff Games and Propositional Proofs

» Witnesses for nonsatisfiability of dense random 3CNF formulas

» The Generalized Deadlock Resolution Problem

Post Info
More Details (n/a)

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

Comments (0)