Explicit lower bounds via geometric complexity theory
From MaRDI portal
Publication:5495784
DOI10.1145/2488608.2488627zbMath1293.68138arXiv1210.8368MaRDI QIDQ5495784
Peter Bürgisser, Christian Ikenmeyer
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
determinant; permanent; tensor rank; Kronecker coefficients; matrix multiplication; geometric complexity theory
68R05: Combinatorics in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)