Towards computing the Grothendieck constant
From MaRDI portal
Publication:4633863
Quadratic programming (90C20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Recommendations
Cited in
(16)- Efficient rounding for the noncommutative Grothendieck inequality
- Tight hardness of the non-commutative Grothendieck problem
- Computing the Grothendieck constant of some graph classes
- Quadratic forms on graphs
- scientific article; zbMATH DE number 3989761 (Why is no real title available?)
- A new upper bound for the complex Grothendieck constant
- The Grothendieck constant is strictly smaller than Krivine's bound
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Grothendieck constant is norm of Strassen matrix multiplication tensor
- Survey on nonlocal games and operator space theory
- Hadamard's matrices, Grothendieck's constant, and root two
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
- The positive semidefinite Grothendieck problem with rank constraint
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Quadratic forms on graphs (extended abstract)
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)
