Extended GCD and hermite normal form algorithms via lattice basis reduction

Experimental Mathematics

Volumn 7, Issue 2, 1998, Pages 125-136

  Havas, George ^a   Majewski, Bohdan S ^b   Matthews, Keith R ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032325491     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.1998.10504362     Document Type: Article

References (28)

1. W. A. Blankinship, "A new version of the Euclidean algorithm", Amer. Math. Monthly 70 (1963), 742-745.
2. W. Bosma, J. Cannon, and C. Playoust, "The Magma algebra system, I: The user language", J. Symbolic Comput. 24:3-4 (1997), 235-265. See http://www.maths.usyd.edu.au:8000/comp/rnagrna/Overview.html.
3. G. H. Bradley, "Algorithm and bound for the greatest common divisor of n integers", Comm. ACM 13 (1970), 433-436.
4. A. J. Brentjes, Multidimensional continued fraction algorithms, Mathematical Centre Tracts 145, Mathematisch Centrum, Amsterdam, 1981.
5. H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics 138, Springer, Berlin, 1993.
6. J M. Daberkow, Über die Besiimmung der ganzen Elemenie in Radik alerweit erungen alqebraischer Zahlkorper, Dissertation, Tech. Univ. Berlin, Berlin, 1995.
7. B. M. M. de Weger, "Solving exponential Diophantine equations using lattice basis reduction algorithms", J. Number Theory 26:3 (1987), 325-367
8. Erratum in 31:1 (1989), 88-89.
9. F. A. Ficken, "Rosser' s generalization of t he Euclid algorithm", Duke Math. J. 10 (1943), 355- 379.
10. D. Ford and G. Havas, "A new algorithm and refined bounds for extended GCD computation", pp. 145-150 in Algorithmic number theory (Talence, 1996), edited by H. Cohen, Lecture Notes in Comput. Sci. 1122, Springer, Berlin, 1996.
11. M. Grotschel, L. Lovasz, and A. Schrijver, Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics 2, Springer, Berlin, 1988.
12. G. Havas and B. S. Majewski, "Hermite normal form computation for integer matrices", Congr. Numer. 105 (1994), 8796.
13. G. Havas and B. S. Majewski, "Extended gcd calculation", Congr. Numer. 111 (1995), 104-114.
14. V. E. Hoggatt Jr., Fibonacci and Lucas Numbers, Houghton MifHin Co., Boston, 1969.
15. n = f ··u", J. Reine Angew. Math. 69 (1868), 1-28.
16. S. Kertzner, "The linear Diophantine equation", Amer. Math. Monthly 88:3 (1981), 200-203.
17. D. E. Knuth, The art of computer programming, Vol. 2: Seminumerical algorithms, 1st ed., Addison-Wesley, Reading, MA, 1969.
18. D. E. Knuth, The art of computer I programming, Vol. 2: Seminumerical algorithms, 2nd ed., Addikon-Wesley, Reading, MA, 1981.
19. A. K. Lenstra, H. W. Lenstra Jr., and L. Lovasz, "Factoring polynomials with rational coefficients", Math. Ann. 261:4 (1982), 515-534.
20. B. S. Majewski and G. Havas, "The complexity of greatest common divisor computations", pp. 184-193 in Algorithmic number theory (Ithaca, NY, 1994), edited by L. M. Adleman and M.-D. Huang, Lecture Notes in Comput. Sci. 877, Springer, Berlin, 1994.
21. B. S. Majewski and G. Havas, "A solution to the extended gcd problem", pp. 248-253 in ISSAC'95: Proceedings of the 1995 Int ernational Symposium on Symbolic and Algebraic Computation (Montreal, 1995), edited by A. H. M. Levelt, ACM Press, New York, 1995.
22. K. R. Matthews, "Minimal multipliers for consecutive Fibonacci numbers", Acta Arith. 75:3 (1996), 205-218.
23. M. Pohst and H. Zassenhaus, Algorithmic algebraic number theory, Encyclopedia of Mathematics and its Applications 30, Cambridge University Press, Cambridge, 1989.
24. B. Rosser, "A note on the linear Diophantine equation", Amer. Math. Monthly 48 (1941), 662-666.
25. C. Rossner and J.-P. Seifert, "The complexity of approximate optima for greatest common divisor computations", pp. 307-322 in Algorithmic number theory (Talence, 1996), edited by H. Cohen, Lecture Notes in Comput. Sci. 1122, Springer, Berlin, 1996.
26. C.-P. Schnorr and M. Euchner, "Lat t ice basis reduction: improved practical algorithms and solving subset sum problems", pp. 68-85 in FUndamentals of computation theory (Gosen, 1991), edited by L. Budach, Lecture Notes in Comput. Sci. 529, Springer, Berlin, 1991.
27. M. Schönert et al., GAP: Groups, algorithms, and programming, Lehrstuhl D für Mathematik, RWTH Aachen, 1996. See ftp://dimacs.rutgers.edu/pub/or http://www-gap.dcs. st-and.ac.uk/-gap.
28. C. C. Sims, Computation with finitely presented groups, Encyclopedia of Mathematics and its Applications 48, Cambridge University Press, Cambridge, 1994.