Polynomial Interpolation for Sherali-Adams Lower Bounds
Nathan Acheampong, Ben Davis, Robert Robere
We prove Sherali-Adams is exponentially weaker than Res(2), and also that it is not automatable unless P = NP.
Manuscript 2026. [PDF]
McGill University / Computer Science
Associate Professor · Computational Complexity · Proof Complexity
Nathan Acheampong, Ben Davis, Robert Robere
We prove Sherali-Adams is exponentially weaker than Res(2), and also that it is not automatable unless P = NP.
Manuscript 2026. [PDF]