Discrete Applied Mathematics · 2012 · 63 citations · 37 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationBijective CombinatoricsComplexity TheoryComputability TheoryComputational ComplexityGroup TheoryStructural ComplexityCompleteness ReductionsComplexity-theoretic ReductionsGroup Homomorphisms
37
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
On the Structure of Polynomial Time Reducibility
Richard E. Ladner · Journal of the ACM · 1975 · 790 citations · Full text
Undirected connectivity in log-space
Omer Reingold · Journal of the ACM · 2008 · 511 citations