Loading...
Please wait, while we are loading the content...
Similar Documents
Extended gcd algorithms
| Content Provider | Semantic Scholar |
|---|---|
| Author | Havas, George Majewski, Bohdan S. Matthews, Kevin R. |
| Abstract | Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We study algorithms for finding good multipliers and present new algorithms with improved performance. We present a well-performing algorithm which is based on lattice basis reduction methods and may be formally analyzed. We also give a relatively fast algorithm with moderate performance. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://staff.itee.uq.edu.au/havas/TR0302.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
