Tensor-rank and lower bounds for arithmetic formulas
From MaRDI portal
Publication:2875193
DOI10.1145/1806689.1806780zbMath1293.90043OpenAlexW1994433543MaRDI QIDQ2875193
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806780
Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions ⋮ Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication ⋮ A case of depth-3 identity testing, sparse factorization and duality ⋮ Barriers for Rank Methods in Arithmetic Complexity ⋮ The Computational Power of Depth Five Arithmetic Circuits ⋮ A spectral theory for tensors ⋮ Tensor Rank is Hard to Approximate ⋮ A Selection of Lower Bounds for Arithmetic Circuits ⋮ Border Rank Nonadditivity for Higher Order Tensors ⋮ Unifying known lower bounds via geometric complexity theory
This page was built for publication: Tensor-rank and lower bounds for arithmetic formulas
