Multiple GCDs. Probabilistic analysis of the plain algorithm (Q2963213)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiple GCDs. Probabilistic analysis of the plain algorithm |
scientific article; zbMATH DE number 6683834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple GCDs. Probabilistic analysis of the plain algorithm |
scientific article; zbMATH DE number 6683834 |
Statements
Multiple GCDs. probabilistic analysis of the plain algorithm (English)
0 references
10 February 2017
0 references
analytic combinatorics
0 references
average-case analysis
0 references
dynamical analysis
0 references
GCD algorithms
0 references
generating functions
0 references
0.9715396165847778
0 references
0.842706024646759
0 references
0.8245372772216797
0 references
0.816390872001648
0 references
0.8150120973587036
0 references
