scientific article; zbMATH DE number 1273655

zbMATH Open1019.11507MaRDI QIDQ4237385FDOQ4237385

Authors: Lars Langemyr 

Publication date: 14 March 2000

Title of this publication is not available (Why is that?)

Recommendations

• Optimizations of the subresultant algorithm
• scientific article; zbMATH DE number 3922806
• The computation of polynomial greatest common divisors over an algebraic number field
• Subresultants revisited.
• Computational schemes for subresultant chains

zbMATH Keywords

greatest common divisor of polynomialssubresultant algorithmsubresultant polynomial remainder sequence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Cited In (4)

• On the complexity of the Lickteig-Roy subresultant algorithm
• Title not available (Why is that?)
• Computer Algebra in Scientific Computing
• A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function

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