( en | de | ru )

 

Disambiguation of "Kurpisz, Adam"

Author of the publication

copydeleteadd this publication to your clipboard
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations.

, , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 362-374. Springer, (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 Stanski

Tobias Adam

Christoph Adam

 

Other publications of authors with the same name

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)Recoverable Robust Combinatorial Optimization Problems., , and . OR, page 147-153. Springer, (2012)A technique for obtaining true approximations for k-center with covering constraints., , , and . Math. Program., 192 (1): 3-27 (2022)A Wiener process perspective on local intrinsic dimension estimation methods., , , and . CoRR, (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)Parallel Machine Scheduling under Uncertainty., , and . IPMU (4), volume 300 of Communications in Computer and Information Science, page 74-83. Springer, (2012)Sum of Squares Bounds for the Empty Integral Hull Problem., and . ISSAC, page 443-451. ACM, (2023)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)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)