Diagonalization strikes back: some recent lower bounds in complexity theory

DOI10.1007/978-3-642-22685-4_21MaRDI QIDQ3087953zbMATH OpenOpenAlexFDO

Authors Ryan Williams

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_21

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(6)

• scientific article; zbMATH DE number 1507040 (Why is no real title available?)
• scientific article; zbMATH DE number 1860655 (Why is no real title available?)
• Diagonalization in proof complexity
• The Complexity of the Diagonal Problem for Recursion Schemes
• Thinking algorithmically about impossibility (invited talk)
• Iterated lower bound formulas: a diagonalization-based approach to proof complexity

This page was built for publication: Diagonalization strikes back: some recent lower bounds in complexity theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087953)