Theoretical Computer Science · 2004 · 46 citations · 25 references
ComputingComputer ScienceMathematicsAlgorithmsKnowledge RepresentationTheory Of ComputationComputational ComplexityConstraint SatisfactionPredicate LogicStructural ComplexitySyntactic ComplexityComplexityComplexity Of SatisfiabilityResolutions
25
The intractability of resolution
Armin Haken · Theoretical Computer Science · 1985 · 829 citations
The relative efficiency of propositional proof systems
Stephen Cook, Robert A. Reckhow · Journal of Symbolic Logic · 1979 · 827 citations
Alasdair Urquhart · Journal of the ACM · 1987 · 451 citations · Full text
Short proofs are narrow—resolution made simple
Eli Ben‐Sasson, Avi Wigderson · Journal of the ACM · 2001 · 430 citations
Simplified and improved resolution lower bounds
Paul Beame, Toniann Pitassi · 2002 · 197 citations