A fast algorithm for finding ``small solutions of \(F(x,y)= G(x,y)\) over imaginary quadratic fields

DOI10.1006/jsco.1993.1050zbMath0806.11018OpenAlexW1972947556MaRDI QIDQ1318848

István Gaál

Publication date: 13 February 1995

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1993.1050

zbMATH Keywords

imaginary quadratic fieldring of integersLLL-basis reduction algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Diophantine inequalities (11D75) Cubic and quartic Diophantine equations (11D25) Diophantine equations (11D99)

Related Items

Solving explicitly \(F(x,y)=G(x,y)\) over function fields ⋮ Calculating ``small solutions of inhomogeneous relative Thue inequalities