Concepedia
Theoretical Computer Science · 2009 · 40 citations · 39 references
EngineeringAutomated ReasoningProof ComplexityFormal MethodsNondeterministic FunctionsComputational ComplexityProof SystemFormal VerificationNon-deterministic Game
39
Encyclopedia of Mathematics and its Applications.
Y. L. L., William B. Jones, W. J. Thron · Mathematics of Computation · 1982 · 4.1K citations
Spectral Theory, Theoretical Mathematics, Geometry Of Number +2
The relative efficiency of propositional proof systems
Stephen Cook, Robert A. Reckhow · Journal of Symbolic Logic · 1979 · 818 citations
Frege Systems, Engineering, Automated Reasoning +13
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
William Craig · Journal of Symbolic Logic · 1957 · 664 citations
Expressive Power, Engineering, Automated Reasoning +12
The complexity of optimization problems
Mark W. Krentel · Journal of Computer and System Sciences · 1988 · 451 citations
Mathematical Programming, Engineering, Optimization Problem +6
Lower bounds for resolution and cutting plane proofs and monotone computations
Pavel Pudlák · Journal of Symbolic Logic · 1997 · 413 citations
Circuit Complexity, Mathematical Programming, Computational Complexity Theory +11