Verification of proofs of unsatisfiability for CNF formulas | NobleBlocks

Verification of proofs of unsatisfiability for CNF formulas

Public

Verification of proofs of unsatisfiability for CNF formulas

N

Shared by NobleBlocks on Mar 3, 2003 • 12:00 AM UTC

Authors:

E. Goldberg

,

Y. Novikov

Subject

Computer Science

Research Assistant

AI chat, annotations, notes & similar papers

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!

Publication Date: Mar 3, 2003 • 12:00 AM UTC

NobleID:w1/20260525/5B2CC217

DOI:10.1109/DATE.2003.1253718

No figures available

Scan for Errors

Scan for EDDII

Summarise

Generate Podcast