Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazine
How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers.
Complexity Theory’s 50-Year Journey to the Limits of Knowledge | Quanta Magazine Home Complexity Theory’s 50-Year Journey to the Limits of Knowledge Read Later Share Copied! Comments Read Later Read Later computational complexity Complexity Theory’s 50-Year Journey to the Limits of Knowledge By Ben Brubaker August 17, 2023 How hard is it to prove that problems are hard to solve? Meta-complexity theorists have been asking questions like this for decades. A string of recent results has started to deliver answers. Read Later Complexity theorists are confronting their most puzzling problem ye
Explore this link on the map →related reading
- P versus NP problem - Wikipediaen.wikipedia.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- NP-completeness - Wikipediaen.wikipedia.org
- Complexity class - Wikipediaen.wikipedia.org
- Computational Complexityblog.computationalcomplexity.org
- PCP theorem - Wikipediaen.wikipedia.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Computational Complexity: Favorite Theorems: Relativizationblog.computationalcomplexity.org
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- What P vs NP is actually about – Vasek Rozhon's blogvasekrozhon.wordpress.com
- NP (complexity) - Wikipediaen.wikipedia.org
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca