A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers


We give an algorithm for the symbolic solution of polynomial systems in Z[X,Y ]. Following previous work with Lebreton, we use a combination of lifting and modular composition techniques, relying in particular on Kedlaya and Umans’ recent quasilinear time modular composition algorithm. The main contribution in this paper is an adaptation of a deflation… (More)
DOI: 10.1016/j.jco.2015.11.009