Computational Complexity · 2015 · 35 citations · 41 references
ComputingComputer EngineeringComputer ScienceAlgorithmsCircuit TheoryTheory Of ComputationAlgorithm AnalysisCircuit ComplexityComputational ComplexityDeductive VerificationTheorem ProvingCircuit Lower BoundsCircuit Upper BoundsProof Mining
41
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
A Pseudorandom Generator from any One-way Function
Johan Håstad, Russell Impagliazzo, Leonid A. Levin et al. · SIAM Journal on Computing · 1999 · 1.7K citations