A New Look at an Old Equation

DOI10.1007/978-3-540-79456-1_2zbMath1206.11152OpenAlexW1489824661MaRDI QIDQ3502726

Reginald E. Sawilla, Alan K. Silvester, Hugh C. Williams

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79456-1_2

zbMATH Keywords

complexityLas Vegas algorithmbinary quadratic Diophantine equationLagrange's techniqueprincipal ideal of quadratic order

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Computer solution of Diophantine equations (11Y50) Parallel algorithms in computer science (68W10) Algebraic number theory computations (11Y40)

Related Items

InfoMod: a visual and computational approach to Gauss' binary quadratic forms, Pell-type equations and class number of the maximal real subfield of a cyclotomic field, Refined and generalized \(\widehat{Z}\) invariants for plumbed 3-manifolds, On solving a binary quadratic Diophantine equation

Cites Work

• Modular arithmetic on elements of small norm in quadratic fields
• Binary quadratic forms. An algorithmic approach
• Computing discrete logarithms in quadratic orders
• Cornacchia's algorithm
• An improved real-quadratic-field-based key exchange procedure
• On the Diophantine equation \(u^2-Dv^2=\pm 4N\)
• On the smallest solution to the general binary quadratic diophantine equation
• A fast, rigorous technique for computing the regulator of a real quadratic field
• Computations of class numbers of real quadratic fields
• A Note on NUCOMP
• On the Parallel Generation of the Residues for the Continued Fraction Factoring Algorithm
• Quadratic class numbers and character sums
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item