Geometric complexity theory and tensor rank
From MaRDI portal
Publication:5419121
DOI10.1145/1993636.1993704zbMath1288.68103arXiv1011.1350MaRDI QIDQ5419121
Christian Ikenmeyer, Peter Bürgisser
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1350
multiplicities; orbit closures; tensor rank; Kronecker coefficients; matrix multiplication; geometric complexity theory
68Q25: Analysis of algorithms and problem complexity
15A15: Determinants, permanents, traces, other special matrix functions
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
On cap sets and the group-theoretic approach to matrix multiplication, Unnamed Item, A Note on normalizations of orbit closures, Universal points in the asymptotic spectrum of tensors, Barriers for Rank Methods in Arithmetic Complexity, Membership in Moment Polytopes is in NP and coNP, Real and complex Waring rank of reducible cubic forms, Tensor rank: matching polynomials and Schur rings, Fundamental invariants of orbit closures, Geometric complexity theory and matrix powering, Polystability in positive characteristic and degree lower bounds for invariant rings, Equations for GL invariant families of polynomials, Geometric complexity theory: an introduction for geometers, 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, Tensor surgery and tensor rank, Lower bounds on the rank and symmetric rank of real tensors, On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions
