Pages that link to "Item:Q2361674"
From MaRDI portal
The following pages link to An approximating \(k\)-ary GCD algorithm (Q2361674):
Displaying 6 items.
- Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm (Q681960) (← links)
- An effective programming of GCD algorithms for natural numbers (Q2225857) (← links)
- An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling (Q2365172) (← links)
- Fast computation of GCDs (Q4062638) (← links)
- ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION (Q4550791) (← links)
- A Paper-and-Pencil gcd Algorithm for Gaussian Integers (Q5446307) (← links)