Adam Kurpisz

1. A Technique for Obtaining True Approximations for k-Center with\n Covering Constraints
   2020/07/08 by Georg Anegg, Anegg, Georg, Haris Angelidakis +5 · 7 citations
   Business, Management and Accounting · #68Q25 #68W40 #90C05 #90C27 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Facility Location and Emergency Management #Optimization and Control (math.OC)
2. SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization
   2021/07/08 by Adam Kurpisz, Kurpisz, Adam, Aaron Potechin +3 · 1 citation
   Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems #Optimization and Packing Problems
3. 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
4. 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