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 quasi-linear time modular composition algorithm. The main cont...

Full description

Bibliographic Details

Published in:	Journal of Complexity Vol. 34; pp. 78 - 128
Main Authors:	Mehrabi, Esmaeil, Schost, Éric
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01-06-2016
Subjects:	Algorithm Bivariate system Complexity Bivariate system Algorithm Complexity
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!