A polynomial time algorithm for diophantine equations in one variable

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

29 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)21-29
Journal / PublicationJournal of Symbolic Computation
Volume27
Issue number1
Publication statusPublished - Jan 1999

Abstract

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.

Citation Format(s)

A polynomial time algorithm for diophantine equations in one variable. / Cucker, Felipe; Koiran, Pascal; Smale, Steve.
In: Journal of Symbolic Computation, Vol. 27, No. 1, 01.1999, p. 21-29.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review