A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858)
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 heuristic verification of the degree of the approximate GCD of two univariate polynomials |
scientific article; zbMATH DE number 6363119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic verification of the degree of the approximate GCD of two univariate polynomials |
scientific article; zbMATH DE number 6363119 |
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
0 references
0 references
0 references
0 references
0 references
0 references
