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

DOI10.1137/1016027zbMath0289.12105MaRDI 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

15A72: Vector and tensor algebra, theory of invariants

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

12E05: Polynomials in general fields (irreducibility, etc.)

Related Items

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