A New Look at Classical Algorithms for Polynomials Resultant and G.C.D. Calculation

DOI10.1137/1016027zbMath0289.12105OpenAlexW2039107195MaRDI QIDQ4777414

Stephen Barnett

Publication date: 1974

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1016027

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (2)

A two variable criterion for extrema with related effective procedure ⋮ On redundance in aperiodicity criteria

This page was built for publication: A New Look at Classical Algorithms for Polynomials Resultant and G.C.D. Calculation