Solution of the propeller conjecture in R^3

DOI10.1145/2213977.2214003MaRDI QIDQ5415480zbMATH OpenOpenAlexFDO

Authors Steven Heilman, Aukosh Jagannath, Assaf Naor

Publication date 13 May 2014

Published in Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2213977.2214003

zbMATH Keywords

Grothendieck inequalitieskernel clusteringsemidefinite programmingunique games hardness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Semidefinite programming (90C22)

Recommendations

• Solution of the propeller conjecture in R^3
• On a conjecture of Grünbaum concerning partitions of convex sets
• Euclidean partitions optimizing noise stability
• On the Borsuk problem in \(\mathbb R^ 3\).
• Approximate kernel clustering

Cited in

(1)

• Solution of the propeller conjecture in R^3

This page was built for publication: Solution of the propeller conjecture in \(\mathbb{R}^3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415480)