On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions
@inproceedings{Drfler2019OnGC, title={On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions}, author={Julian D{\"o}rfler and Christian Ikenmeyer and G. Panova}, booktitle={ICALP}, year={2019} }
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group varieties. The papers also conjecture that the vanishing behavior of these multiplicities would be sufficient to separate complexity classes (so-called occurrence obstructions). The existence of such strong occurrence obstructions has been recently disproven in 2016… Expand
Topics from this paper
3 Citations
Implementing geometric complexity theory: on the separation of orbit closures via symmetries
- Mathematics, Computer Science
- STOC
- 2020
- 2
- PDF
The Computational Complexity of Plethysm Coefficients
- Mathematics, Computer Science
- Comput. Complex.
- 2020
- 1
- PDF
References
SHOWING 1-10 OF 55 REFERENCES
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- Mathematics, Computer Science
- SIAM J. Comput.
- 2008
- 114
- PDF
No Occurrence Obstructions in Geometric Complexity Theory
- Mathematics, Computer Science
- 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
- 2016
- 34
- PDF
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
- Mathematics, Computer Science
- SIAM J. Comput.
- 2001
- 211
Padded Polynomials, Their Cousins, and Geometric Complexity Theory
- Mathematics, Computer Science
- ArXiv
- 2012
- 25
- PDF
Reduced Kronecker Coefficients and Counter–Examples to Mulmuley’s Strong Saturation Conjecture SH
- Mathematics, Computer Science
- computational complexity
- 2009
- 34
- PDF