Proving SAT does not have small circuits with an application to the two queries problem

Random generation of combinatorial structures from a uniform distribution

Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 985 citations

Engineering, Combinatory Analysis, Randomized Algorithm +6

The complexity of optimization problems

Mark W. Krentel · Journal of Computer and System Sciences · 1988 · 451 citations

Mathematical Programming, Engineering, Optimization Problem +6

Random generation of combinatorial structures from a uniform

Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani · Theoretical Computer Science · 1986 · 250 citations

Engineering, Randomized Algorithm, Combinatorial Design Theory +6

The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses

Jim Kadin · SIAM Journal on Computing · 1988 · 125 citations

Circuit Complexity, Computational Complexity Theory, Engineering +15

Symmetric alternation captures BPP

Alexander Russell, Ravi Sundaram · Computational Complexity · 1998 · 71 citations

Equivalence Checking, Formal Methods