Algorithms and Computation

DOI10.1007/B104582MaRDI QIDQ5712136zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen, Igor E. Shparlinski

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104582

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• GCD of random linear combinations
• Probabilistic computation of integer polynomial GCDs
• Multiple GCDs. Probabilistic analysis of the plain algorithm
• On computation of the greatest common divisor of several polynomials over a finite field.
• Probabilistic analyses of the plain multiple gcd algorithm

Cited in

(3)

• GCD of random linear combinations
• Some related functions to integer GCD and coprimality
• scientific article; zbMATH DE number 3838108 (Why is no real title available?)

This page was built for publication: Algorithms and Computation

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