A Polynomial Time Algorithm for Diophant
β
F CUCKER; P KOIRAN; S SMALE
π
Article
π
1999
π
Elsevier Science
π
English
β 195 KB
We exhibit an algorithm computing, for a polynomial f β Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .