Efficient computation of maximal orders in radical (including Kummer) extensions
From MaRDI portal
Publication:412222
DOI10.1016/j.jsc.2011.12.053zbMath1269.11125OpenAlexW1983923069MaRDI QIDQ412222
Publication date: 4 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.053
Related Items (2)
Efficient computation of maximal orders in Artin-Schreier-Witt extensions ⋮ ALGORITHMS FOR GALOIS EXTENSIONS OF GLOBAL FUNCTION FIELDS
Uses Software
Cites Work
- Algebraic function fields and codes
- Implementing the Round Four maximal order algorithm
- Approximating rings of integers in number fields
- Advanced Topics in Computional Number Theory
- On computations in Kummer extensions.
- Factoring polynomials over local fields.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient computation of maximal orders in radical (including Kummer) extensions