![Algorithms and Complexity in Algebraic Geometry_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithms%20and%20Complexity%20in%20Algebraic%20Geometry_hi-res.jpg?h=450de763&itok=r3pqykMn)
Description
The Complexity of Homotopy Methods for Solving Systems of Polynomial Equations
A homotopy method begins with a system path f_t and a root z_0 of f_0 and continues the root along f_t to find a root of f_1. We give a complexity upper bound and explore the problem of "finding hay in the haystack",,, that is good starting point.
All scheduled dates:
Upcoming
No Upcoming activities yet