Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
From MaRDI portal
Publication:689905
DOI10.1007/BF03167202zbMath0796.12007MaRDI QIDQ689905
Publication date: 29 September 1994
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
11Y99: Computational number theory
Uses Software
Cites Work
- Three new algorithms for multivariate polynomial GCD
- On Hensel factorization. I
- The EEZ-GCD algorithm
- The Subresultant PRS Algorithm
- Polynomial Remainder Sequences and Determinants
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item