scientific article; zbMATH DE number 4144078

MaRDI QIDQ3475342zbMATH OpenFDO

Authors A. L. Chistov

Publication date 1989

zbMATH Keywords

complexitycomputational number theorybasis of integral closure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic number theory: global fields (11R99) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• scientific article; zbMATH DE number 66619
• Publication:4937808
• Algorithms in Algebraic Number Theory
• Publication:3197949
• Approximating rings of integers in number fields

Cited in

(11)

• Polynomial complexity algorithms for computational problems in the theory of algebraic curves
• The infrastructure of a global field of arbitrary unit rank
• Efficient computation of maximal orders in Artin-Schreier-Witt extensions
• Efficient computation of maximal orders in radical (including Kummer) extensions
• Function field sieve method for discrete logarithms over finite fields
• Computing Riemann-Roch spaces in algebraic function fields and related topics.
• Effective construction of an algebraic variety nonsingular in codimension one over a ground field of zero characteristic
• Approximating rings of integers in number fields
• Computing algebraic numbers of bounded height
• Computing normal integral bases of abelian number fields
• Identifying the matrix ring: algorithms for quaternion algebras and quadratic forms

This page was built for publication:

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