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
3 Citations
Implementing geometric complexity theory: on the separation of orbit closures via symmetries
  • 2
  • PDF
The Computational Complexity of Plethysm Coefficients
  • 1
  • PDF
On the complexity of evaluating highest weight vectors
  • PDF

References

SHOWING 1-10 OF 55 REFERENCES
No Occurrence Obstructions in Geometric Complexity Theory
  • 34
  • PDF
Explicit lower bounds via geometric complexity theory
  • 36
  • PDF
Geometric complexity theory and tensor rank
  • 54
  • PDF
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
  • 211
Mathematics: Frontiers and Perspectives
  • 158
  • PDF
Padded Polynomials, Their Cousins, and Geometric Complexity Theory
  • 25
  • PDF
Complex projective varieties
  • 68
Reduced Kronecker Coefficients and Counter–Examples to Mulmuley’s Strong Saturation Conjecture SH
  • 34
  • PDF
...
1
2
3
4
5
...