Algorithmic Number Theory

DOI10.1007/B98210zbMATH Open1148.11320OpenAlexW2791103999MaRDI QIDQ5465645FDOQ5465645

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

Recommendations

• Fast quantum algorithms for computing the unit group and class group of a number field
• scientific article
• 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

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Pisot unit generators in number fields
• The complexity of computing all subfields of an algebraic number field
• An algorithm in a complex field (and its application to the calculation of units)

This page was built for publication: Algorithmic Number Theory

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