Efficient computation of maximal orders in Artin-Schreier extensions

DOI10.1016/j.jsc.2012.11.001zbMath1317.11132OpenAlexW2062264563MaRDI QIDQ1946963

Nicole Sutherland

Publication date: 10 April 2013

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2012.11.001

zbMATH Keywords

maximal ordersArtin-Schreier extensions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Arithmetic theory of algebraic function fields (11R58) Algebraic number theory computations (11Y40)

Related Items (2)

Efficient computation of maximal orders in Artin-Schreier-Witt extensions ⋮ ALGORITHMS FOR GALOIS EXTENSIONS OF GLOBAL FUNCTION FIELDS

This page was built for publication: Efficient computation of maximal orders in Artin-Schreier extensions