Sign in
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy.
Adam Kurpisz
Samuli Leppänen
Monaldo Mastrolilli
Published in:
ICALP (1) (2015)
Keyphrases
</>
stable set
semidefinite
semidefinite programming
computational complexity
sufficient conditions