Algorithmic Number Theory

DOI10.1007/B98210zbMATH Open1125.11353OpenAlexW2791103999MaRDI QIDQ5465626FDOQ5465626

Authors: Florian Hess 

Publication date: 12 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98210

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Algebraic number theory computations (11Y40)

Cited In (8)

• Equivalence of differential equations of order one
• Computing splitting fields using Galois theory and other Galois constructions
• Computing isomorphisms and embeddings of finite fields
• Tschirnhaus-Weierstrass curves
• On automorphism groups of cyclotomic function fields over finite fields
• Numerical computation of endomorphism rings of Jacobians
• Maps between curves and arithmetic obstructions
• Projective and affine symmetries and equivalences of rational and polynomial surfaces

This page was built for publication: Algorithmic Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465626)