On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
Ketan D. Mulmuley
TL;DR
This paper provides an overview of geometric complexity theory (GCT) as an approach to the P vs. NP problem, focusing on its complexity theoretic aspects without requiring background in algebraic geometry or representation theory.
Contribution
It offers a comprehensive complexity theoretic overview of GCT, making the approach accessible without advanced mathematical prerequisites.
Findings
GCT offers a promising framework for tackling P vs. NP.
The paper clarifies the complexity theoretic foundations of GCT.
It discusses the potential of GCT to overcome the complexity barrier.
Abstract
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
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
TopicsAlgebraic structures and combinatorial models · Commutative Algebra and Its Applications · Advanced Combinatorial Mathematics