A polynomial time algorithm for diophantine equations in one variable

Citation
F. Cucker et al., A polynomial time algorithm for diophantine equations in one variable, J SYMB COMP, 27(1), 1999, pp. 21-29
Citations number
8
Categorie Soggetti
Engineering Mathematics
Journal title
JOURNAL OF SYMBOLIC COMPUTATION
ISSN journal
07477171 → ACNP
Volume
27
Issue
1
Year of publication
1999
Pages
21 - 29
Database
ISI
SICI code
0747-7171(199901)27:1<21:APTAFD>2.0.ZU;2-X
Abstract
We exhibit an algorithm computing, for a polynomial f is an element of z [t ], the set of its integer roots. The running time of the algorithm is polyn omial in the size of the sparse encoding of f. (C) 1999 Academic Press.