Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. W.A. Blankinship. A new version of the Euclidean algorithm. Amer. Math. Mon., 70:742–745, 1963.
2. G.H. Bradley. Algorithm and bound for the greatest common divisor of n integers. Commun. ACM, 13:433–436, 1970.
3. G. Havas and B.S. Majewski. Integer matrix diagonalization. J. Symbolic Comput., to appear.
4. G. Havas and B.S. Majewski. Hermite normal form computation for integer matrices. Congressus Numerantium, 105:184–193, 1994.
5. G. Havas and B.S. Majewski. A hard problem which is almost always easy. In Algorithms and Computation, Lecture Notes in Computer Science 1004, 216–223, 1995.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the bases of Zn lattice;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
2. Functional synthesis for linear arithmetic and sets;International Journal on Software Tools for Technology Transfer;2011-11-22
3. On the complexity of the extended euclidean algorithm (Extended Abstract);Electronic Notes in Theoretical Computer Science;2003-04
4. Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction;Experimental Mathematics;1998-01