A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time

Pierre Lairez

We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the i…