Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.11369OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899237

Nigel Boston, Harris Nover

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Galois theory (11R32) Algebraic number theory computations (11Y40)

Related Items (8)

On the \(T\)-ramified, \(S\)-split \(p\)-class field towers over an extension of degree prime to \(p\) ⋮ Computation of Galois groups associated to the 2-class towers of some imaginary quadratic fields with 2-class group \(C_2 \times C_2\times C_2\) ⋮ Heuristics for \(p\)-class towers of imaginary quadratic fields ⋮ On Hilbert 2-class fields and 2-towers of imaginary quadratic number fields ⋮ 3-class field towers of exact length 3 ⋮ Non-abelian Cohen–Lenstra heuristics over function fields ⋮ HEURISTICS FOR -CLASS TOWERS OF REAL QUADRATIC FIELDS ⋮ The 2-Class Tower of $$\mathbb {Q}(\sqrt{-5460})$$Q(-5460)

This page was built for publication: Algorithmic Number Theory