Theoretical Computer Science · 1984 · 97 citations · 8 references
ComputingComputer ScienceAlgorithmsComputational PhysicsTheory Of ComputationAlgorithm AnalysisApproximation AlgorithmsComputational ComplexityComputational MathematicsMonte Carlo MethodsTime ComplexityApproximation ComplexityComputational EfficiencyDensity Calculations
8
Computational Complexity of Probabilistic Turing Machines
John Gill · SIAM Journal on Computing · 1977 · 694 citations
Some connections between nonuniform and uniform complexity classes
Richard M. Karp, Richard J. Lipton · 1980 · 582 citations · Full text
On Isomorphisms and Density of $NP$ and Other Complete Sets
L. Berman, Juris Hartmanis · SIAM Journal on Computing · 1977 · 460 citations
Two theorems on random polynomial time
Leonard M. Adleman · 1978 · 317 citations