Simplified and Improved Resolution Lower Bounds (1996)

Cached

Download Links

by Paul Beame , Toniann Pitassi
Venue:IN PROCEEDINGS OF THE 37TH IEEE FOCS
Citations:100 - 7 self

Active Bibliography

55 The efficiency of resolution and Davis-Putnam procedures – Paul Beame, Richard Karp, Toniann Pitassi, Michael Saks - 1999
127 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
Probabilistic Analysis of Satisfiability Algorithms – John Franco - 2008
98 Generating Hard Satisfiability Problems – Bart Selman, David Mitchell, Hector Levesque - 1996
2 The Complexity of Resource-Bounded Propositional Proofs – Albert Atserias - 2001
24 Satisfiability Solvers – Carla P. Gomes, Henry Kautz, Ashish Sabharwal, Bart Selman - 2008
51 On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas – Paul Beame, Richard Karp, Toniann Pitassi, Michael Saks - 1997
114 Finding Hard Instances of the Satisfiability Problem: A Survey – Stephen A. Cook, David G. Mitchell - 1997
72 The Probabilistic Analysis of a Greedy Satisfiability Algorithm – Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas - 2002
24 Random k-SAT: two moments suffice to cross a sharp threshold – Dimitris Achlioptas, Cristopher Moore - 2006
Chapter 2 Satisfiability Solvers – Edited F. Van Harmelen, V. Lifschitz, B. Porter, Carla P. Gomes, Henry Kautz, Ashish Sabharwal, Bart Selman
13 Narrow proofs may be spacious: Separating space and width in resolution (Extended Abstract) РJakob Nordstr̦m - 2005
9 The Complexity of Automated Reasoning РAndr̩ Vellino - 1989
1 Toward A Good Algorithm for Determining Unsatisfiability of Propositional Formulas – John Franco, R. Swaminathan - 1995
17 A Perspective on Certain Polynomial Time Solvable Classes of Satisfiability – John Franco, Allen Van Gelder - 1998
17 Rigorous results for random (2 + p)-SAT – Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc - 2001
@?!JMakoto – Kikuchi Proof Theory
1 Exponential Lower Bounds on the Size of Clause Based Semantic Derivations – Stasys Jukna - 1996
5 Incomplete Algorithms – Henry Kautz, Ashish Sabharwal, Bart Selman - 2008