Sciweavers

357 search results - page 5 / 72
» Computations of class numbers of real quadratic fields
Sort
View
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 7 months ago
Fast quantum algorithms for computing the unit group and class group of a number field
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...
Sean Hallgren
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 7 months ago
Coinductive Formal Reasoning in Exact Real Arithmetic
In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations...
Milad Niqui
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
13 years 5 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight
MOC
2000
74views more  MOC 2000»
13 years 7 months ago
Computing the tame kernel of quadratic imaginary fields
J. Tate has determined the group K2OF (called the tame kernel) for six quadratic imaginary number fields F = Q( d), where d = -3, -4, -7, -8, -11, -15. Modifying the method of Tat...
Jerzy Browkin, Karim Belabas, Herbert Gangl
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 22 days ago
On the Complexity of Computing Units in a Number Field
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...
Vikraman Arvind, Piyush P. Kurur