Samuli Leppänen

1. On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
   2015/10/07 by Adam Kurpisz, Kurpisz, Adam, Samuli Leppänen +3 · 1 citation
   Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS
2. Tight Sum-of-Squares lower bounds for binary polynomial optimization problems
   2016/05/10 by Adam Kurpisz, Kurpisz, Adam, Samuli Leppänen +3 · 1 citation
   Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS