A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11075-013-9793-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031661066 / rank | |||
Normal rank | |||
Revision as of 01:19, 20 March 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
