Analysis of the subtractive algorithm for greatest common divisors
Abstract
- Analysis of the subtractive algorithm for greatest common divisors
Recommendations
Fast algorithms for Abelian periods in words and greatest common divisor queries
We present efficient algorithms computing all Abelian periods of two types in a word. Regular Abelian periods are computed in O ( n log ź log ź n ) randomized time which improves over the best previously known algorithm by almost a factor of n. The ...
Chebyshev's bias for composite numbers with restricted prime divisors
Let π(x;d,a) denote the number of primes p ≤ x with p ≡ a(modd). Chebyshev's bias is the phenomenon for which "more often" π(x; d, n) > π(x; d, r), than the other way around, where n is a quadratic nonresidue mod d and r is a quadratic residue mod d. If ...
A lower bound for integer greatest common divisor computations
It is proved that no finite computation tree with operations { +, -, *, /, mod, < } can decide whether the greatest common divisor (gcd) of a and b is one, for all pairs of integers a and b. This settles a problem posed by Gro¨tschel et al. Moreover, if ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 277Total Downloads
- Downloads (Last 12 months)42
- Downloads (Last 6 weeks)12
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in