A theory and an algorithm for computing sparse multivariate polynomial remainder sequence (Q1798335)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A theory and an algorithm for computing sparse multivariate polynomial remainder sequence |
scientific article; zbMATH DE number 6962581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A theory and an algorithm for computing sparse multivariate polynomial remainder sequence |
scientific article; zbMATH DE number 6962581 |
Statements
A theory and an algorithm for computing sparse multivariate polynomial remainder sequence (English)
0 references
23 October 2018
0 references
multivariate polynomial remainder sequence
0 references
cofactor sequence
0 references
sparse multivariate polynomials
0 references
pseudo remainder
0 references
sparse pseudo remainder
0 references
subresultant
0 references
Hearn's trial-division algorithm
0 references
0.90262294
0 references
0.9015007
0 references
0.9015006
0 references
0.89715266
0 references
0 references
0.88394994
0 references
0.8813854
0 references
