Efficient computation of maximal orders in radical (including Kummer) extensions
From MaRDI portal
Publication:412222
DOI10.1016/J.JSC.2011.12.053zbMATH Open1269.11125OpenAlexW1983923069MaRDI QIDQ412222FDOQ412222
Authors: Nicole Sutherland 
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
Recommendations
Cites Work
- Algebraic function fields and codes
- Implementing the Round Four maximal order algorithm
- Computation of maximal orders of cyclic extensions of function fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advanced Topics in Computional Number Theory
- On computations in Kummer extensions.
- Title not available (Why is that?)
- Approximating rings of integers in number fields
- Title not available (Why is that?)
- Factoring polynomials over local fields.
Cited In (7)
- Title not available (Why is that?)
- Efficient computation of maximal orders in Artin-Schreier-Witt extensions
- Title not available (Why is that?)
- Implementing the Round Four maximal order algorithm
- Title not available (Why is that?)
- Algorithms for Galois extensions of global function fields. (Abstract of thesis)
- Efficient computation of maximal orders in Artin-Schreier extensions
Uses Software
This page was built for publication: Efficient computation of maximal orders in radical (including Kummer) extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412222)
