On computing polynomial GCDs in alternate bases (Q2958970)
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 computing polynomial GCDs in alternate bases |
scientific article; zbMATH DE number 6680749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing polynomial GCDs in alternate bases |
scientific article; zbMATH DE number 6680749 |
Statements
On computing polynomial GCDs in alternate bases (English)
0 references
3 February 2017
0 references
Krylov matrices
0 references
Euclidean algorithm
0 references
fraction-free arithmetic
0 references
orthogonal polynomials
0 references
subresultants
0 references
0.8175422549247742
0 references
0.7955535054206848
0 references
0.7925431132316589
0 references
0.7897526621818542
0 references
