On the complexity of computing units in a number field

DOI10.1007/978-3-540-24847-7_5MaRDI QIDQ5465645zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, Piyush P. Kurur

Publication date 12 August 2005

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

Full work available at URL https://doi.org/10.1007/b98210

Mathematics Subject Classification ID

Units and factorization (11R27) Algebraic number theory computations (11Y40)

Recommendations

• Fast quantum algorithms for computing the unit group and class group of a number field
• scientific article; zbMATH DE number 6488046
• Subexponential algorithms for class group and unit computations
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Recognizing Units in Number Fields

Cited in

(5)

• An algorithm in a complex field (and its application to the calculation of units)
• Pisot unit generators in number fields
• The complexity of computing all subfields of an algebraic number field
• Recognizing Units in Number Fields
• scientific article; zbMATH DE number 953031 (Why is no real title available?)

This page was built for publication: On the complexity of computing units in a number field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465645)