| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401540 | Journal of Symbolic Computation | 2011 | 16 Pages |
Abstract
Let K be a number field and F(X,Y) an absolutely irreducible polynomial of K[X,Y] such that the algebraic curve defined by the equation F(X,Y)=0 is rational. In this paper we present practical algorithms for the determination of all solutions of the Diophantine equation F(X,Y)=0 in algebraic integers of K.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
