Paul Breiding

dblp:210/2581 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-3747-9185ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2025 A short proof for the parameter continuation theorem
abstract
The Parameter Continuation Theorem is the theoretical foundation for polynomial homotopy continuation, which is one of the main tools in computational algebraic geometry. In this note, we give a short proof using Gröbner bases. Our approach gives a method for computing discriminants.
Viktoriia Borovik, Paul Breiding
J. Symb. Comput.2
2023 Certifying Zeros of Polynomial Systems Using Interval Arithmetic
abstract
We establish interval arithmetic as a practical tool for certification in numerical algebraic geometry. Our software HomotopyContinuation.jl now has a built-in function certify , which proves the correctness of an isolated nonsingular solution to a square system of polynomial equations. The implementation rests on Krawczyk’s method. We demonstrate that it dramatically outperforms earlier approaches to certification. We see this contribution as a powerful new tool in numerical algebraic geometry, which can make certification the default and not just an option.
Paul Breiding, Kemal Rose, Sascha Timme
ACM Trans. Math. Softw.1