A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ

DOI10.2307/2008809zbMath0713.11088OpenAlexW4230413383MaRDI QIDQ3197947

Kenneth Hardy, Joseph B. Muskat, Kenneth S. Williams

Publication date: 1990

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

Full work available at URL: https://doi.org/10.2307/2008809

zbMATH Keywords

algorithmquadratic diophantine equation

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16) Representation problems (11D85)

Related Items (7)

Thue's theorem and the diophantine equation $x^2-Dy^2=\pm N$ ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ Recovering a sum of two squares decomposition ⋮ Cyclotomic problem, Gauss sums and Legendre curve ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ A Subexponential Algorithm for Evaluating Large Degree Isogenies ⋮ End-symmetric continued fractions and quadratic congruences

This page was built for publication: A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ