Algorithmic Number Theory
From MaRDI portal
Publication:5899241
DOI10.1007/11792086zbMath1143.11368OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899241
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11792086
Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)
Related Items (6)
Norm relations and computational problems in number fields ⋮ Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's \(p\)-rationality conjecture ⋮ A class number problem in the cyclotomic \(\mathbb Z_3\)-extension of \(\mathbb Q\) ⋮ Tate-Shafarevich groups in the cyclotomic \(\hat{\mathbb{Z}} \)-extension and Weber's class number problem ⋮ Computation of the $p$-part of the ideal class group of certain real abelian fields ⋮ Weber’s Class Number One Problem
This page was built for publication: Algorithmic Number Theory