Efficient computation of maximal orders in Artin-Schreier-Witt extensions
DOI10.1016/J.JSC.2016.01.008zbMATH Open1414.11159OpenAlexW3013839258MaRDI QIDQ277232FDOQ277232
Authors: Nicole Sutherland 
Publication date: 4 May 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2016.01.008
Recommendations
- Efficient computation of maximal orders in Artin-Schreier extensions
- Efficient computation of maximal orders in radical (including Kummer) extensions
- Computation of maximal orders of cyclic extensions of function fields
- scientific article; zbMATH DE number 2186836
- On the Computation of Integral Closures of Cyclic Extensions of Function Fields
Class field theory (11R37) Other abelian and metabelian extensions (11R20) Arithmetic theory of algebraic function fields (11R58) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Algebraic function fields and codes
- Implementing the Round Four maximal order algorithm
- Efficient computation of maximal orders in Artin-Schreier extensions
- Computation of maximal orders of cyclic extensions of function fields
- Title not available (Why is that?)
- Applications of the class field theory of global fields
- Title not available (Why is that?)
- Efficient computation of maximal orders in radical (including Kummer) extensions
- 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.
Cited In (4)
Uses Software
This page was built for publication: Efficient computation of maximal orders in Artin-Schreier-Witt extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277232)
