A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:37, 30 January 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
