On the Complexity of Solving Bivariate Systems
Venerdì 14 novembre 2014 Eric Schost (Computer Science Department, University of Western Ontario)
We present an algorithm for solving bivariate polynomial systems with coefficients in $mathbb{Q}$ with essentially optimal bit complexity. The core of the algorithm is a classical Newton iteration procedure. New ingredients are needed, though, such as Kedlaya-Umans' modular composition algorithm and deflation techniques due to Lecerf.Joint work with Esmaeil Mehrabi.