Untitled
Geometric complexity theory is an approach towards proving lower bounds in algebraic complexity theory via methods from algebraic geometry and representation theory.It was introduced by Mulmuley and Sohoni and has gained significant momentum over the last few years.Since deep methods from several different areas of mathematics are involved, geometric complexity theory has a steep learning curve.There are great survey articles on geometric complexity theory, but those require a significant level of mathematical background or often only sketch many of the proofs, see, e.
Authors
- Markus Blaeser
- Christian Ikenmeyer
Publication Details
- Journal
- Theory of Computing
- Published
- 2025-01-01
- DOI
- https://doi.org/10.4086/toc.gs.2025.010
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00