( en | de | ru )

 

Disambiguation of "Kurpisz, Adam"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.

, , and . ICALP, volume 55 of LIPIcs, page 78:1-78:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Adam

Milan Adam

Adam Williamson

Marion Adam

Adam Pluskota

 

Other publications of authors with the same name

Recoverable Robust Combinatorial Optimization Problems., , and . OR, page 147-153. Springer, (2012)Approximating the min-max (regret) selecting items problem., , and . Inf. Process. Lett., 113 (1-2): 23-29 (2013)A Technique for Obtaining True Approximations for k-Center with Covering Constraints., , , and . IPCO, volume 12125 of Lecture Notes in Computer Science, page 52-65. Springer, (2020)Approximating a two-machine flow shop scheduling under discrete scenario uncertainty., , and . Eur. J. Oper. Res., 217 (1): 36-43 (2012)A technique for obtaining true approximations for k-center with covering constraints., , , and . Math. Program., 192 (1): 3-27 (2022)Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems., , and . ACM Trans. Comput. Theory, 16 (1): 3:1-3:16 (March 2024)SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization., , and . ICALP, volume 198 of LIPIcs, page 90:1-90:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials., , and . Found. Comput. Math., 22 (2): 365-387 (2022)Sum-Of-Squares Bounds via Boolean Function Analysis.. ICALP, volume 132 of LIPIcs, page 79:1-79:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Improved Approximations for Translational Packing of Convex Polygons., and . ESA, volume 274 of LIPIcs, page 76:1-76:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)