Geometric Complexity Theory: an introduction for geometers
J.M. Landsberg

TL;DR
This paper introduces Geometric Complexity Theory (GCT), a geometric approach to tackling fundamental computational complexity questions like P vs. NP, providing an accessible survey for graduate students and highlighting open problems in algebraic geometry and representation theory.
Contribution
It offers an accessible tutorial and survey of GCT, connecting algebraic geometry and representation theory to complexity theory, and presents open questions in the field.
Findings
Survey of recent GCT developments
Identification of open problems in algebraic geometry
Tutorial aimed at graduate students
Abstract
This article is a survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be accessible to graduate students. Numerous open questions in algebraic geometry and representation theory relevant for GCT are presented.
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
TopicsPolynomial and algebraic computation · Advanced Combinatorial Mathematics · Homotopy and Cohomology in Algebraic Topology
