Block Systems of a Galois Group
From MaRDI portal
Publication:4867488
DOI10.1080/10586458.1995.10504303zbMath0976.12006OpenAlexW2083357849MaRDI QIDQ4867488
Publication date: 14 June 1999
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1062621138
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
The complexity of computing all subfields of an algebraic number field ⋮ Linear groups and computation ⋮ On computing subfields. A detailed description of the algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An \(\widehat{A_4}\) extension of \({\mathbb{Q}}\) attached to a non-selfdual automorphic form on \(GL(3)\)
- Simplification of expressions involving radicals
- Computing Galois groups over the rationals
- Solvability by radicals is in polynomial time
- Factoring polynomials with rational coefficients
- Ideal decompositions and subfields
- Computation of Galois groups over function fields
- A polynomial reduction algorithm
- Factoring Polynomials Over Algebraic Number Fields
This page was built for publication: Block Systems of a Galois Group
