Multiple GCDs. probabilistic analysis of the plain algorithm

DOI10.1145/2465506.2465512zbMath1360.68972OpenAlexW2101431603MaRDI QIDQ2963213

Valérie Berthé, Loïck Lhote, Jean Creusefond, Brigitte Vallée

Publication date: 10 February 2017

Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2465506.2465512

zbMATH Keywords

generating functionsaverage-case analysisanalytic combinatoricsdynamical analysisGCD algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Number-theoretic algorithms; complexity (11Y16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

Probabilistic analyses of the plain multiple gcd algorithm

This page was built for publication: Multiple GCDs. probabilistic analysis of the plain algorithm