Probabilistic computation of integer polynomial GCDs

DOI10.1016/0196-6774(88)90027-2MaRDI QIDQ3796740zbMATH OpenOpenAlexFDO

Authors Arnold Schönhage

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90027-2

zbMATH Keywords

gcdprobabilistic algorithmunivariate integer polynomials

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 17841
• GCD of random linear combinations
• Multiple GCDs. Probabilistic analysis of the plain algorithm
• Probabilistic analyses of the plain multiple gcd algorithm
• On computation of the greatest common divisor of several polynomials over a finite field.

Cited in

(8)

• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• A deterministic algorithm for finding \(r\)-power divisors
• GCD of random linear combinations
• \texttt{PTOPO}: computing the geometry and the topology of parametric curves
• Multiple GCDs. Probabilistic analysis of the plain algorithm
• Algorithms and Computation
• A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
• Probabilistic analyses of the plain multiple gcd algorithm

This page was built for publication: Probabilistic computation of integer polynomial GCDs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796740)