Sciweavers

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

6

DATE
2003
IEEE

favoriteEmaildiscussreport

80views Hardware» more DATE 2003»

Verification of Proofs of Unsatisfiability for CNF Formulas

13 years 9 months ago

Verification of Proofs of Unsatisfiability for CNF Formulas

Download www.cadence.com

Evguenii I. Goldberg, Yakov Novikov

Real-time Traffic

DATE 2003 | Hardware |

claim paper

Related Content

» On the Complexity of Unsatisfiability Proofs for Random kCNF Formulas

» On Finding All Minimally Unsatisfiable Subformulas

» Hardness Amplification in Proof Complexity

» OnTheFly Resolve Trace Minimization

» Narrow proofs may be spacious separating space and width in resolution

» Boundary Points and Resolution

» The Efficiency of Resolution and DavisPutnam Procedures

» Model Counting A New Strategy for Obtaining Good Bounds

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

Post Info
More Details (n/a)

Added	04 Jul 2010
Updated	04 Jul 2010
Type	Conference
Year	2003
Where	DATE
Authors	Evguenii I. Goldberg, Yakov Novikov

Comments (0)