Towards computing the Grothendieck constant
From MaRDI portal
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Quadratic programming (90C20)
Recommendations
Cited in
(18)- A new upper bound for the complex Grothendieck constant
- Grothendieck constant is norm of Strassen matrix multiplication tensor
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Survey on nonlocal games and operator space theory
- Hadamard's matrices, Grothendieck's constant, and root two
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- The positive semidefinite Grothendieck problem with rank constraint
- scientific article; zbMATH DE number 3989761 (Why is no real title available?)
- Computing the Grothendieck constant of some graph classes
- Tight hardness of the non-commutative Grothendieck problem
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- The Grothendieck constant is strictly smaller than Krivine's bound
- Efficient rounding for the noncommutative Grothendieck inequality
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
- Quadratic forms on graphs
- Quadratic forms on graphs (extended abstract)
- Classical bounds on two-outcome bipartite Bell expressions and linear prepare-and-measure witnesses: Efficient computation in parallel environments such as graphics processing units
- Estimating the matrix p q norm
This page was built for publication: Towards computing the Grothendieck constant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633863)
