Algorithms for a multiple algebraic extension. II
From MaRDI portal
[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.
Recommendations
- scientific article; zbMATH DE number 16654
- Algorithms for computing multiplier ideals
- scientific article; zbMATH DE number 4053362
- scientific article; zbMATH DE number 3920595
- Computational algorithms for algebraic operations on multidimensional polynomials
- Algorithms in A_-algebras
- On some classes of algorithmic algebras
- scientific article; zbMATH DE number 927443
- Algorithms for Bernstein-Sato polynomials and multiplier ideals
- Prolongations and Computational Algebra
Cited in
(5)- A modular method for computing the Galois groups of polynomials
- Efficient arithmetic in successive algebraic extension fields using symmetries
- Extending the PSLQ Algorithm to Algebraic Integer Relations
- scientific article; zbMATH DE number 16654 (Why is no real title available?)
- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
This page was built for publication: Algorithms for a multiple algebraic extension. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038758)