Towards computing the Grothendieck constant
From MaRDI portal
Publication:4633863
zbMATH Open1422.68135MaRDI QIDQ4633863FDOQ4633863
Authors: Prasad Raghavendra, David Steurer 
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496828
Recommendations
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)
Cited In (16)
- Computing the Grothendieck constant of some graph classes
- Quadratic forms on graphs
- Title not available (Why is that?)
- 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
- Quadratic forms on graphs (extended abstract)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Efficient rounding for the noncommutative Grothendieck inequality
- Tight hardness of the non-commutative Grothendieck problem
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)
