Journal of Computer and System Sciences · 1976 · 717 citations · 13 references
ComputingComputer ScienceMathematicsAlgorithmsNumber TheoryTheory Of ComputationCombinatorial Number TheoryComputational ComplexityComputational Number TheoryNumber-theoretic AlgorithmsPrimality TestingUpper Bound ComputationUpper Bounds
13
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Every Prime Has a Succinct Certificate
Vaughan Pratt · SIAM Journal on Computing · 1975 · 310 citations