PolSys seminar


On the Complexity of Solving Bivariate Systems

Friday, November 14, 2014
Speaker(s) :  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.

More details here …
Elias.Tsigaridas (at) nulllip6.fr