On the complexity of unsatisfiability proofs for random k-CNF formulas

Paul Beame, Richard Karp, Toniann Pitassi, Michael Saks

Research output: Contribution to journalConference articlepeer-review

70 Scopus citations

Fingerprint Dive into the research topics of 'On the complexity of unsatisfiability proofs for random k-CNF formulas'. Together they form a unique fingerprint.