Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials (Q3590274)
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 5786921
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials |
scientific article; zbMATH DE number 5786921 |
Statements
17 September 2010
0 references
symbolic computation
0 references
complexity analysis
0 references
greatest common divisors of polynomials
0 references
parametric euclidean algorithm
0 references
linear algebraic systems
0 references
parametric gaussian elimination
0 references
0.8586355447769165
0 references
0.8468955755233765
0 references
0.8306388854980469
0 references
0.8296459913253784
0 references
0.82546067237854
0 references
