Explicit lower bounds via geometric complexity theory
From MaRDI portal
Publication:5495784
DOI10.1145/2488608.2488627zbMath1293.68138arXiv1210.8368OpenAlexW2150207005MaRDI QIDQ5495784
Christian Ikenmeyer, Peter Bürgisser
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.8368
determinantpermanenttensor rankKronecker coefficientsmatrix multiplicationgeometric complexity theory
Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Equations for GL invariant families of polynomials ⋮ Geometric aspects of iterated matrix multiplication ⋮ Bounds on Kronecker coefficients via contingency tables ⋮ On vanishing of Kronecker coefficients ⋮ Tensor rank: matching polynomials and Schur rings ⋮ 16,051 formulas for Ottaviani's invariant of cubic threefolds ⋮ On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions ⋮ Fundamental invariants of orbit closures ⋮ Unnamed Item ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case ⋮ Unifying known lower bounds via geometric complexity theory ⋮ The Saxl conjecture and the dominance order