Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator (Q4181955)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3619310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator |
scientific article; zbMATH DE number 3619310 |
Statements
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator (English)
0 references
1978
0 references
Efficient Sparse Minor Expansion Algorithm
0 references
Polynomial Subresultants
0 references
Greatest Common Denominator
0 references
Sparse Matrices
0 references
Sparse Polynomials
0 references
