Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

39

STOC
2005
ACM

favoriteEmaildiscussreport

138views Algorithms» more STOC 2005»

Fast quantum algorithms for computing the unit group and class group of a number field

14 years 11 months ago

Fast quantum algorithms for computing the unit group and class group of a number field

Download www.cse.psu.edu

Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's equation, which is a special case of computing the unit group, but a reduction in the other direction is not known and appears more difficult. We give polynomial-time quantum algorithms for computing the unit group and class group when the number field has constant degree.

Sean Hallgren

Real-time Traffic

Algorithms | Class Group | Computational Algebraic Number | STOC 2005 | Unit Group |

claim paper

Related Content

» On the Complexity of Computing Units in a Number Field

» Polynomial time quantum algorithm for the computation of the unit group of a number field

» Algorithms for ray class groups and Hilbert class fields

» On Class Group Computations Using the Number Field Sieve

» Computation of Locally Free Class Groups

» Computing Hilbert Modular Forms over Fields with Nontrivial Class Group

» Polynomialtime quantum algorithms for Pells equation and the principal ideal problem

» Algorithmic Enumeration of Ideal Classes for Quaternion Orders

» Fast realistic multiaction recognition using mined dense spatiotemporal features

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Sean Hallgren

Comments (0)