The Complexity of Automated Reasoning (1989)

by André Vellino
Citations:9 - 0 self

Active Bibliography

125 Algorithms for the Satisfiability (SAT) Problem: A Survey – Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah - 1996
1 A Prolog Implementation of an Analytic Tableau Theorem Prover for the Propositional Calculus – André Vellino - 1989
7 Limitations of Restricted Branching in Clause Learning – Matti Järvisalo, Tommi Junttila
22 Satisfiability Solvers – Carla P. Gomes, Henry Kautz, Ashish Sabharwal, Bart Selman - 2008
100 Simplified and Improved Resolution Lower Bounds – Paul Beame, Toniann Pitassi - 1996
13 Narrow proofs may be spacious: Separating space and width in resolution (Extended Abstract) – Jakob Nordström - 2005
1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale
The Gödel Phenomena in Mathematics: A Modern View – Avi Wigderson
2 A History of Satisfiability – John Franco, John Martin - 2009
40 Upper and Lower Bounds for Tree-like Cutting Planes Proofs – Russell Impagliazzo, Toniann Pitassi, Alasdair Urquhart - 1994
The Relative Complexity of Analytic Tableaux and SL-Resolution – André Vellino
Towards NP−P via Proof Complexity and Search – Samuel R. Buss - 2009
218 Hard and Easy Distributions of SAT Problems – David Mitchell, Bart Selman, Hector Levesque - 1992
98 Generating Hard Satisfiability Problems – Bart Selman, David Mitchell, Hector Levesque - 1996
2 The Complexity of Resource-Bounded Propositional Proofs – Albert Atserias - 2001
3 THE RESOLUTION COMPLEXITY OF INDEPENDENT SETS AND VERTEX COVERS IN RANDOM GRAPHS – Paul Beame, Russell Impagliazzo, Ashish Sabharwal
3 Automating Pseudo-Boolean Inference within a DPLL Framework – Heidi Dixon - 2004
19 Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially – Jan Friso Groote, Hans Zantema - 2000
1 Optimal seperation of Treelike and General Resolution – Eli Ben-sasson, Russell Impagliazzo, Avi Wigderson - 1999