Algorithms for a multiple algebraic extension. II (Q4038758)
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 177876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for a multiple algebraic extension. II |
scientific article; zbMATH DE number 177876 |
Statements
18 May 1993
0 references
greatest common divisors
0 references
multiple extension of the rationals
0 references
dynamic evaluations
0 references
probabilistic algorithm
0 references
univariate polynomials
0 references
0.89070785
0 references
0.86876386
0 references
0 references
0.8663214
0 references
0.8647108
0 references
0.8632176
0 references
Algorithms for a multiple algebraic extension. II (English)
0 references
[For the entire collection see Zbl 0758.00016.] This paper is very similar to an earlier one [MEGA '90, Prog. Math. 94, 235-248 (1991; Zbl 0741.11053)]. Here the g.c.d. of two univariate polynomials over a multiple algebraic extension of the rational numbers is considered.
0 references