A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MultRoot / rank | |||
Normal rank | |||
Revision as of 15:37, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic verification of the degree of the approximate GCD of two univariate polynomials |
scientific article |
Statements
A heuristic verification of the degree of the approximate GCD of two univariate polynomials (English)
0 references
31 October 2014
0 references
polynomial
0 references
greatest common divisor
0 references
verification
0 references
