Geometric complexity theory and tensor rank

DOI10.1145/1993636.1993704zbMath1288.68103arXiv1011.1350OpenAlexW2007666181MaRDI 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

zbMATH Keywords

multiplicitiesorbit closurestensor rankKronecker coefficientsmatrix multiplicationgeometric complexity theory

Mathematics Subject Classification ID

Related Items (19)

Universal points in the asymptotic spectrum of tensors ⋮ Real and complex Waring rank of reducible cubic forms ⋮ Equations for GL invariant families of polynomials ⋮ Geometric complexity theory and matrix powering ⋮ Tensor rank: matching polynomials and Schur rings ⋮ Tensor surgery and tensor rank ⋮ Lower bounds on the rank and symmetric rank of real tensors ⋮ Barriers for Rank Methods in Arithmetic Complexity ⋮ On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions ⋮ On cap sets and the group-theoretic approach to matrix multiplication ⋮ Fundamental invariants of orbit closures ⋮ Unnamed Item ⋮ A Note on normalizations of orbit closures ⋮ Polystability in positive characteristic and degree lower bounds for invariant rings ⋮ 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 ⋮ Membership in Moment Polytopes is in NP and coNP

This page was built for publication: Geometric complexity theory and tensor rank