Diagonalization strikes back: some recent lower bounds in complexity theory

Authors:
Ryan Williams
Affiliations:
IBM Almaden Research Center
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 6
Cited 0

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The tight deterministic time hierarchy

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Time-space lower bounds for satisfiability

Journal of the ACM (JACM)
Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing
Non-uniform ACC Circuit Lower Bounds

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The area of complexity lower bounds is concerned with proving impossibility results for bounded-resource computation. In spite of its apparent weaknesses, the ancient method of diagonalization has played a key role in recent lower bounds. This short article briefly recalls diagonalization along with its strengths and weaknesses, and describes a little about how diagonalization has made a recent comeback in complexity theory (although many would argue that it never really went away).