Theoretical Computer Science · 1988 · 104 citations · 6 references
ComputingComputer ScienceMathematicsAlgorithmsFormal MethodsTheory Of ComputationPigeonhole PrinciplePredicate LogicProof ComplexityTheorem ProvingClassical Pigeonhole PrincipleGeneralized Pigeonhole PrincipleResolution Theorem ProvingStrong Pigeonhole PrincipleWeak Pigeonhole Principle
6
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