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

A Class of Polynomial Equations in a Single Ordinal Variable

โœ Scribed by John L. Hickman

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
229 KB
Volume
26
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Polynomial Time Algorithm for Diophant
A Polynomial Time Algorithm for Diophantine Equations in One Variable
โœ 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 .

Polynomial Bounds for the Solutions of a
Polynomial Bounds for the Solutions of a Class of Diophantine Equations
โœ Dimitrios Poulakis ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 320 KB

Let K be an algebraic number field such that all the embeddings of K into C are real. We denote by O K the ring of algebraic integers of K. Let F(X, Y) be an irreducible polynomial in K[X, Y ]&K[Y ] of total degree N and of degree n>0 in Y. We denote by F N (X, Y ) its leading homogeneous part. Supp