"Tight Sum-of-Squares lower bounds for binary polynomial optimization problems."

Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli (2016)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics