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). © 2011 Springer-Verlag.
Cite
CITATION STYLE
Williams, R. (2011). Diagonalization strikes back: Some recent lower bounds in complexity theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6842 LNCS, pp. 237–239). https://doi.org/10.1007/978-3-642-22685-4_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
