Shortest division chains in unique factorization domains

DOI10.1016/j.jsc.2016.02.003zbMath1411.11137OpenAlexW2311918708MaRDI QIDQ277230

Maksim Vaskouski, Nikita Kondratyonok

Publication date: 4 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.02.003

zbMATH Keywords

continued fractionEuclidean algorithmEuclidean domainunique factorization domain

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Euclidean rings and generalizations (13F07)

Related Items (2)

Primes in quadratic unique factorization domains ⋮ The Kronecker-Vahlen theorem fails in real quadratic norm-Euclidean fields

Cites Work

• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Shortest division chains in imaginary quadratic number fields
• Euclidean Quadratic Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Shortest division chains in unique factorization domains