Grothendieck constant is norm of Strassen matrix multiplication tensor
From MaRDI portal
Publication:2334621
DOI10.1007/s00211-019-01070-6zbMath1426.15033arXiv1711.04427OpenAlexW2969598375MaRDI QIDQ2334621
Jinjie Zhang, Lek-Heng Lim, Shmuel Friedland
Publication date: 7 November 2019
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.04427
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Complexity and performance of numerical algorithms (65Y20) Multilinear algebra, tensor calculus (15A69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Tensor products of linear operators (47A80)
Related Items
Tensors in computations, Complex best \(r\)-term approximations almost always exist in finite dimensions, The global convergence of the nonlinear power method for mixed-subordinate matrix norms, An elementary and unified proof of Grothendieck's inequality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- Matrix multiplication via arithmetic progressions
- The Grothendieck constant of random and pseudo-random graphs
- Rank and optimal computation of generic tensors
- A new upper bound for the complex Grothendieck constant
- Constantes de Grothendieck et fonctions de type positif sur les sphères
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- An elementary and unified proof of Grothendieck's inequality
- Efficient algorithms for privately releasing marginals via convex relaxations
- Gaussian elimination is not optimal
- Grothendieck-Type Inequalities in Combinatorial Optimization
- Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
- The UGC Hardness Threshold of the Lp Grothendieck Problem
- Grothendieck inequalities for semidefinite programs with rank constraint
- Powers of tensors and fast matrix multiplication
- Simulating Quantum Correlations with Finite Communication
- The Positive Semidefinite Grothendieck Problem with Rank Constraint
- Relative bilinear complexity and matrix multiplication.
- Bell Inequalities, Grothendieck’s Constant, and Root Two
- Nuclear norm of higher-order tensors
- Isometries for the vector (p,q) norm and the induced (p,q) norm
- Sharp kernel clustering algorithms and their associated Grothendieck inequalities
- Linear Algebra and Matrices
- Grothendieck’s Theorem, past and present
- THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
- Multiplying matrices faster than coppersmith-winograd
- Approximating the Cut-Norm via Grothendieck's Inequality
- Quantum correlation and Grothendieck's constant
- Absolutely summing operators in $ℒ_{p}$-spaces and their applications
- Quadratic forms on graphs
- Lower bounds in communication complexity based on factorization norms
