Abstract
Given an algebraic number field K, such that [K : ℚ] is constant, we show that the problem of computing the units group φ*K is in the complexity class SPP. As a consequence, we show that principal ideal testing for an ideal in φK is in SPP. Furthermore, assuming the GRH, the class number of K, and a presentation for the class group of K can also be computed in SPP. A corollary of our result is that solving PELL'S EQUATION, recently shown by Hallgren [12] to have a quantum polynomial-time algorithm, is also in SPP. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Arvind, V., & Kurur, P. P. (2004). On the complexity of computing units in a number field. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3076, 72–86. https://doi.org/10.1007/978-3-540-24847-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
