๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Polynomial Time Algorithm for Diophantine Equations in One Variable

โœ Scribed by F CUCKER; P KOIRAN; S SMALE

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
195 KB
Volume
27
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 .

๐Ÿ“œ SIMILAR VOLUMES

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
โœ Philippe Baptiste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer US ๐ŸŒ English โš– 102 KB ๐Ÿ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t