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 the normal view instead:
scientific article; zbMATH DE number 6363119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8666842579841614
0 references
0.8663612008094788
0 references
0.865635097026825
0 references
0.8619056940078735
0 references
