Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.

Adam Kurpisz, Samuli Leppnen, Monaldo Mastrolilli

Browse the full ICALP paper archive.