On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342)
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: On the complexity of computing the greatest common divisor of several univariate polynomials |
scientific article; zbMATH DE number 7572153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing the greatest common divisor of several univariate polynomials |
scientific article; zbMATH DE number 7572153 |
Statements
On the complexity of computing the greatest common divisor of several univariate polynomials (English)
0 references
16 August 2022
0 references
0 references
0.9752626
0 references
0.9301797
0 references
0.9208261
0 references
0.91584873
0 references
0.91580987
0 references
0.91114485
0 references
0.91079515
0 references
