On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:47, 8 February 2024
scientific article; zbMATH DE number 7572153
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
