Fast computation of GCDs
From MaRDI portal
Recommendations
- Two Fast GCD Algorithms
- The accelerated integer GCD algorithm
- Two fast parallel GCD algorithms of many integers
- A novel fast hybrid GCD computation algorithm
- scientific article; zbMATH DE number 1643956
- Improvements on the accelerated integer GCD algorithm
- Quasi-gcd computations
- Parallel implementation of the accelerated integer GCD algorithm
- An approximating k-ary GCD algorithm
Cited in
(44)- scientific article; zbMATH DE number 17841 (Why is no real title available?)
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
- A univariate attack against the limited-data instance of Ciminion
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- An effective programming of GCD algorithms for natural numbers
- A novel fast hybrid GCD computation algorithm
- Fast rational function reconstruction
- On the complexity of the Lickteig-Roy subresultant algorithm
- A Gröbner free alternative for polynomial system solving
- Sylvester-Habicht sequences and fast Cauchy index computation
- Quasi-gcd computations
- A fast version of the Schur-Cohn algorithm.
- scientific article; zbMATH DE number 3846865 (Why is no real title available?)
- Cauchy index computation
- scientific article; zbMATH DE number 4126699 (Why is no real title available?)
- Convolution number
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- scientific article; zbMATH DE number 3660789 (Why is no real title available?)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation
- Analysis of Euclidean algorithms for polynomials over finite fields
- Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures
- Fast arithmetic in unramified \(p\)-adic fields
- On the complexity of the extended Euclidean algorithm (extended abstract)
- ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION
- scientific article; zbMATH DE number 1736309 (Why is no real title available?)
- New techniques for the computation of linear recurrence coefficients
- A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
- Early termination for sparse interpolation of polynomials in Chebyshev bases
- Sparse polynomial interpolation: faster strategies over finite fields
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
- scientific article; zbMATH DE number 1643956 (Why is no real title available?)
- New bounds and an efficient algorithm for sparse difference resultants
- Euclid's algorithm, Guass' elimination and Buchberger's algorithm
- Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals
- On generator polynomial matrices of quasi-cyclic codes with linear complementary duals
- Complexity of computation in finite fields
- Three new algorithms for multivariate polynomial GCD
- Another polynomial homomorphism
- Around the numeric-symbolic computation of differential Galois groups
- Functional decomposition of polynomials: the tame case
- Two-way unclonable encryption with a vulnerable sender
- Polynomial division and its computational complexity
- Fast computation of approximant bases in canonical form
This page was built for publication: Fast computation of GCDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4062638)
