Theory of Computing Systems · 1991 · 34 citations · 13 references
ComputingComputer ScienceMathematicsAlgorithmsTheory Of ComputationAlgorithmic ComplexityComplexity TheoryComputational ComplexityComputational Complexity ClassesModel TheoryTime ComplexityCompleteness ResultsComplexity ClassesNondeterministic Complexity
13
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Nondeterministic Space is Closed under Complementation
Neil Immerman · SIAM Journal on Computing · 1988 · 649 citations
On Isomorphisms and Density of $NP$ and Other Complete Sets
L. Berman, Juris Hartmanis · SIAM Journal on Computing · 1977 · 460 citations
A comparison of polynomial time reducibilities
Richard E. Ladner, Nancy Lynch, Alan L. Selman · Theoretical Computer Science · 1975 · 414 citations