The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010)
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: The Brun gcd algorithm in high dimensions is almost always subtractive |
scientific article; zbMATH DE number 6789131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Brun gcd algorithm in high dimensions is almost always subtractive |
scientific article; zbMATH DE number 6789131 |
Statements
The Brun gcd algorithm in high dimensions is almost always subtractive (English)
0 references
10 October 2017
0 references
multiple gcd algorithm
0 references
multidimensional continued fraction
0 references
analytic combinatorics
0 references
Dirichlet generating functions
0 references
average-case analysis
0 references
transfer operator
0 references
dynamical analysis
0 references
Tauberian theorem
0 references
0 references
0 references
0 references
0.929075300693512
0 references
0.7605367302894592
0 references
0.7592282295227051
0 references
0.7585073709487915
0 references
0.7576290369033813
0 references
