257 search results - page 1 / 52 » On the Complexity of Computing Units in a Number Field |
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
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 eq...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
MOC
2011
12 years 11 months ago
2011
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...