A computer algorithm for finding new Euclidean number fields

DOI10.5802/jtnb.217zbMath0913.11056OpenAlexW2317022136MaRDI QIDQ1273177

Roland Quême

Publication date: 15 March 1999

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1998__10_1_33_0

zbMATH Keywords

Euclidean algorithminhomogeneous minimumEuclidean number fields\(S\)-integers

Mathematics Subject Classification ID

Other number fields (11R21) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (2)

On the Euclidean minimum of some real number fields ⋮ Euclidean minima of totally real number fields: Algorithmic determination

Cites Work

• Unnamed Item
• Euclidean number fields of large degree
• The Euclidean algorithm in algebraic number fields
• The Euclidean Algorithm in Cubic Number Fields
• On the finite generation of linear groups over Hasse domains.
• LINEAR FORMS ASSOCIATED WITH AN ALGEBRAIC NUMBER-FIELD

This page was built for publication: A computer algorithm for finding new Euclidean number fields