Theoretical Computer Science · 2009 · 40 citations · 39 references
ComputingComputer ScienceMathematicsAlgorithmsFormal MethodsTheory Of ComputationExistence TheoremsProof ComplexityProof TheoryFormal Proof SystemsLower Bounds For Proof SystemsNon-deterministic Polynomial TimeNondeterminismProof Systems
39
The relative efficiency of propositional proof systems
Stephen Cook, Robert A. Reckhow · Journal of Symbolic Logic · 1979 · 827 citations
The complexity of optimization problems
Mark W. Krentel · Journal of Computer and System Sciences · 1988 · 455 citations