TY - JOUR
T1 - A polynomial time algorithm for diophantine equations in one variable
AU - Cucker, Felipe
AU - Koiran, Pascal
AU - Smale, Steve
PY - 1999/1
Y1 - 1999/1
N2 - We exhibit an algorithm computing, for a polynomial f ∈ ℤ [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f.
AB - We exhibit an algorithm computing, for a polynomial f ∈ ℤ [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f.
UR - http://www.scopus.com/inward/record.url?scp=0032615314&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0032615314&origin=recordpage
U2 - 10.1006/jsco.1998.0242
DO - 10.1006/jsco.1998.0242
M3 - RGC 21 - Publication in refereed journal
SN - 0747-7171
VL - 27
SP - 21
EP - 29
JO - Journal of Symbolic Computation
JF - Journal of Symbolic Computation
IS - 1
ER -