scientific article; zbMATH DE number 177876

MaRDI QIDQ4038758zbMATH OpenFDO

Authors Lars Langemyr

Publication date 18 May 1993

zbMATH Keywords

dynamic evaluationsgreatest common divisorsmultiple extension of the rationalsprobabilistic algorithmunivariate polynomials

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Number-theoretic algorithms; complexity (11Y16) Computational aspects and applications of commutative rings (13P99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 16654
• Algorithms for computing multiplier ideals
• scientific article; zbMATH DE number 4053362
• scientific article; zbMATH DE number 3920595
• Computational algorithms for algebraic operations on multidimensional polynomials
• Algorithms in A_-algebras
• On some classes of algorithmic algebras
• scientific article; zbMATH DE number 927443
• Algorithms for Bernstein-Sato polynomials and multiplier ideals
• Prolongations and Computational Algebra

Cited in

(5)

• A modular method for computing the Galois groups of polynomials
• Efficient arithmetic in successive algebraic extension fields using symmetries
• Extending the PSLQ Algorithm to Algebraic Integer Relations
• scientific article; zbMATH DE number 16654 (Why is no real title available?)
• On the Complexity of Linear Algebra Operations over Algebraic Extension Fields

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