Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
From MaRDI portal
Publication:3395039
DOI10.1137/070691140zbMath1178.68670MaRDI QIDQ3395039
Publication date: 20 August 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070691140
semidefinite programming; Grothendieck's inequality; computational convex geometry; Max-E3-Lin-2; refutation of random SAT
68Q25: Analysis of algorithms and problem complexity
90C22: Semidefinite programming
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, On solving biquadratic optimization via semidefinite relaxation, Grothendieck-Type Inequalities in Combinatorial Optimization