A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We show that for every ε > 0, the degree-n^ε Sherali-Adams linear program (with (Õ(n^ε)) variables and constraints) approximates the maximum cut problem within a factor of (1/2+ε'), for some ε'(ε) > 0. Our result provides a surprising converse to known lower bounds against all linear programming relaxations of Max-Cut, and hence resolves the extension complexity of approximate Max-Cut for approximation factors close to 1/2 (up to the function ε'(ε)). Previously, only semidefinite programs andarXiv:1911.10304v2 fatcat:a6zdnblhmrb2fgw5lc7rt7r42m