Challenges in computational lower bounds
Emanuele Viola
TL;DR
This paper explores the difficulties and open problems in establishing computational lower bounds, highlighting the complexity and incomplete understanding in the field.
Contribution
It provides two biased, incomplete maps of the main challenges faced in proving computational lower bounds.
Findings
Identifies key areas where lower bounds are difficult to establish
Highlights the biased and incomplete nature of current understanding
Suggests directions for future research in complexity lower bounds
Abstract
We draw two incomplete, biased maps of challenges in computational complexity lower bounds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · graph theory and CDMA systems · Advanced Graph Theory Research