The Grothendieck Constant is Strictly Smaller than Krivine's Bound

DOI10.1109/FOCS.2011.77zbMath1292.90243WikidataQ56865198 ScholiaQ56865198MaRDI QIDQ5495024

Yury Makarychev, Konstantin Makarychev, Mark Braverman, Assaf Naor

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (19)

Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ Estimates for the asymptotic behaviour of the constants in the Bohnenblust–Hille inequality ⋮ The Bipartite QUBO ⋮ Explicit lower and upper bounds on the entangled value of multiplayer XOR games ⋮ Krivine schemes are optimal ⋮ Solution of the propeller conjecture in \(\mathbb R^3\) ⋮ On symmetric nonlocal games ⋮ Computing the Grothendieck constant of some graph classes ⋮ The work of Mark Braverman ⋮ Unnamed Item ⋮ Quantum Query Algorithms are Completely Bounded Forms. ⋮ Grothendieck’s Theorem, past and present ⋮ Quantum Query Algorithms Are Completely Bounded Forms ⋮ Unnamed Item ⋮ Community detection in sparse networks via Grothendieck's inequality ⋮ The Grothendieck Inequality Revisited ⋮ An invariant version of the little Grothendieck theorem for Sobolev spaces ⋮ Quantum XOR Games ⋮ Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems

This page was built for publication: The Grothendieck Constant is Strictly Smaller than Krivine's Bound