scientific article; zbMATH DE number 1254273

MaRDI QIDQ4227322zbMATH OpenFDO

Authors Franz Binder

Publication date 23 July 2001

zbMATH Keywords

Euclidean algorithmintermediate fields

Mathematics Subject Classification ID

Arithmetic theory of algebraic function fields (11R58) Polynomials in general fields (irreducibility, etc.) (12E05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast rational function reconstruction
• On the decomposition of rational functions
• Basic algorithms for rational function fields
• Generating subfields

Cited in

(12)

• Fast reduction of algebraic lattices over cyclotomic fields
• Fast Hermite interpolation and evaluation over finite fields of characteristic two
• Rational solutions of first-order algebraic ordinary difference equations
• Generally rational polynomials in two variables
• Lattices Over Eisenstein Integers for Compute-and-Forward
• Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
• Asymptotes and perfect curves
• Fast Zeta Transforms for Lattices with Few Irreducibles
• Algorithms for computing maximal lattices in bilinear (and quadratic) spaces over number fields
• A proof of a theorem by Fried and MacRae and applications to the composition of polynomial functions
• On the problem of separating variables in multivariate polynomial ideals
• Rational solutions of ordinary difference equations

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 Q4227322)