Author of the publication

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection.

, and . ISSAC, page 151-158. ACM, (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.

 

Other publications of authors with the same name

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts., , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 98-113. Springer, (2022)A note on the approximability of deepest-descent circuit steps., , , and . Oper. Res. Lett., 49 (3): 310-315 (2021)Paths and walks, forests and planes.. Saarland University, Germany, (2019)Patching Colors with Tensors.. ESA, volume 144 of LIPIcs, page 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Counting Vanishing Matrix-Vector Products., , , and . WALCOM, volume 14549 of Lecture Notes in Computer Science, page 335-349. Springer, (2024)The Complexity of Optimizing Atomic Congestion., , , and . AAAI, page 20044-20052. AAAI Press, (2024)A Polyhedral Perspective on Tropical Convolutions., , and . IWOCA, volume 13889 of Lecture Notes in Computer Science, page 111-122. Springer, (2023)Fast Convolutions for Near-Convex Sequences., and . ISAAC, volume 283 of LIPIcs, page 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP., , and . Algorithmica, 81 (2): 541-556 (2019)Parameterized Algorithms for MILPs with Small Treedepth., , and . CoRR, (2019)