The following pages link to Two Fast GCD Algorithms (Q4289843):
Displaying 27 items.
- Improvements on the accelerated integer GCD algorithm (Q290191) (← links)
- A space-efficient fast prime number sieve (Q671385) (← links)
- Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960) (← links)
- Jebelean-Weber's algorithm without spurious factors (Q846018) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- A parallel extended GCD algorithm (Q1018106) (← links)
- Efficient algorithms for computing the Jacobi symbol (Q1269754) (← links)
- Analysis of a left-shift binary GCD algorithm (Q1338738) (← links)
- On primitive recursive algorithms and the greatest common divisor function (Q1399976) (← links)
- A modular reduction for GCD computation. (Q1421214) (← links)
- Worst-case analysis of Weber's GCD algorithm (Q1607009) (← links)
- A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers (Q1895406) (← links)
- On analogues of Heilbronn's theorem (Q2150617) (← links)
- An effective programming of GCD algorithms for natural numbers (Q2225857) (← links)
- An approximating \(k\)-ary GCD algorithm (Q2361674) (← links)
- Extending the binary gcd algorithms (Q2764238) (← links)
- The mixed binary Euclid algorithm (Q2840536) (← links)
- Some related functions to integer GCD and coprimality (Q2840696) (← links)
- Fast computation of GCDs (Q4062638) (← links)
- (Q4329471) (← links)
- The accelerated integer GCD algorithm (Q4371587) (← links)
- An extended Jebelean^ WeberNSedjelmaci GCD algorithm (Q5109663) (← links)
- On Schönhage's algorithm and subquadratic integer gcd computation (Q5429518) (← links)
- Algorithmic Number Theory (Q5465641) (← links)
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)
- On the continued fraction with rational partial quotients (Q6647860) (← links)
- Cryptanalysis of algebraic verifiable delay functions (Q6652907) (← links)
