On the multi-threaded computation of integral polynomial greatest common divisors (original) (raw)
Related papers
A sparse modular GCD algorithm for polynomials over algebraic function fields
Proceedings of the 2007 international symposium on Symbolic and algebraic computation - ISSAC '07, 2007
IEEE Symposium on Foundations of Computer Science, 1988
Parallel sparse polynomial division using heaps
2010
Fast rational function reconstruction
Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06, 2006
Journal of Symbolic Computation, 1990
Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD
Algorithms for the non-monic case of the sparse modular GCD algorithm
Proceedings of the 2005 international symposium on Symbolic and algebraic computation - ISSAC '05, 2005
IEEE Transactions on Computers, 2000
ANZIAM Journal, 2019
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials
Theoretical Computer Science, 2013
High-performance polynomial GCD computations on graphics processors
2011 International Conference on High Performance Computing & Simulation, 2011
Three new algorithms for multivariate polynomial GCD
Journal of Symbolic Computation, 1992
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials
ACM SIGSAM Bulletin, 2011
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
2010
Algorithms for polynomial GCD computation over algebraic function fields
Proceedings of the 2004 international symposium on Symbolic and algebraic computation - ISSAC '04, 2004
On a modular algorithm for computing GCDs of polynomials over algebraic number fields
Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94, 1994
A Symbolic-Numeric Software Package for the Computation of the GCD of Several Polynomials
Sparse polynomial division using a heap
Journal of Symbolic Computation, 2011
Fast Parallel Computation of Polynomials Using Few Processors
SIAM Journal on Computing, 1983
Algorithms for computing greatest common divisors of parametric multivariate polynomials
Journal of Symbolic Computation, 2021
Approximate greatest common divisor of many polynomials and generalised resultants
2003
Four New Algorithms for Multivariate Polynomial GCD
2016
Sparse Polynomial Pseudo Division Using a Heap
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
Siam Journal on Computing, 1990
On computing greatest common divisors with polynomials given by black boxes for their evaluations
1995
2015
Resultant properties of gcd of many polynomials and a factorization representation of gcd
International Journal of Control, 2003
Fast , Parallel Algorithm for Multiplying Polynomials with Integer Coefficients
2012
On the genericity of the modular polynomial GCD algorithm
1999
On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials
Serdica Journal of Computing, 2015
Optimizing and parallelizing the modular GCD algorithm
2015
A simple algorithm for GCD of polynomials
Annals of mathematics and physics, 2022