A theory and an algorithm for computing sparse multivariate polynomial remainder sequence

DOI10.1007/978-3-319-99639-4_24zbMath1453.13085OpenAlexW2888699173MaRDI QIDQ1798335

Tateaki Sasaki

Publication date: 23 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-99639-4_24

zbMATH Keywords

subresultantcofactor sequenceHearn's trial-division algorithmmultivariate polynomial remainder sequencepseudo remaindersparse multivariate polynomialssparse pseudo remainder

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items (1)

A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)

This page was built for publication: A theory and an algorithm for computing sparse multivariate polynomial remainder sequence