Efficient computation of maximal orders in radical (including Kummer) extensions
From MaRDI portal
(Redirected from Publication:412222)
Recommendations
Cites work
- scientific article; zbMATH DE number 4144078 (Why is no real title available?)
- scientific article; zbMATH DE number 1113832 (Why is no real title available?)
- scientific article; zbMATH DE number 1113845 (Why is no real title available?)
- scientific article; zbMATH DE number 194764 (Why is no real title available?)
- scientific article; zbMATH DE number 3794179 (Why is no real title available?)
- scientific article; zbMATH DE number 904978 (Why is no real title available?)
- Advanced Topics in Computional Number Theory
- Algebraic function fields and codes
- Approximating rings of integers in number fields
- Computation of maximal orders of cyclic extensions of function fields
- Factoring polynomials over local fields.
- Implementing the Round Four maximal order algorithm
- On computations in Kummer extensions.
Cited in
(8)- On the computation of overorders
- Efficient computation of maximal orders in Artin-Schreier-Witt extensions
- Implementing the Round Four maximal order algorithm
- Efficient computation of maximal orders in Artin-Schreier extensions
- Algorithms for Galois extensions of global function fields. (Abstract of thesis)
- scientific article; zbMATH DE number 904978 (Why is no real title available?)
- scientific article; zbMATH DE number 3934399 (Why is no real title available?)
- scientific article; zbMATH DE number 2186836 (Why is no real title available?)
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)