A fast parallel sparse polynomial GCD algorithm
From MaRDI portal
Publication:1994882
DOI10.1016/j.jsc.2020.06.001zbMath1477.68549OpenAlexW3036931303MaRDI QIDQ1994882
Jiaxiong Hu, Michael B. Monagan
Publication date: 18 February 2021
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2020.06.001
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Polynomials, factorization in commutative rings (13P05) Factorization (11Y05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interpolating polynomials from their values
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Interpolation of polynomials given by straight-line programs
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
- Three new algorithms for multivariate polynomial GCD
- Early termination in sparse interpolation algorithms
- On the bit-complexity of sparse polynomial and series multiplication
- The Berlekamp-Massey algorithm revisited
- An improved EZ-GCD algorithm for multivariate polynomials
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
- Using Sparse Interpolation in Hensel Lifting
- Handbook of Finite Fields
- Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm
- The EEZ-GCD algorithm
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A method for solving key equation for decoding goppa codes
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- An Improved Multivariate Polynomial Factoring Algorithm
- Fast parallel multi-point evaluation of sparse polynomials
- On sparse interpolation over finite fields
- Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values
- Diversification improves interpolation
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- Improved Division by Invariant Integers
- Subresultants and Reduced Polynomial Remainder Sequences
- Shift-register synthesis and BCH decoding
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Factoring Polynomials Over Large Finite Fields
- Symbolic-numeric sparse interpolation of multivariate polynomials
