Fast algorithms for linear algebra modulo N

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 139-150

  Storjohann, Arne ^a   Mulders, Thom ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS;

FAST ALGORITHMS; GENERAL SOLUTIONS; INPUT MATRICES; LINEAR ALGEBRA PROBLEMS; MODULO-N; SUBMODULES; SYSTEM OF LINEAR EQUATIONS; TRANSFORMATION MATRICES;

MATRIX ALGEBRA;

EID: 84896772566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_12     Document Type: Conference Paper

References (7)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. E. Bach. Linear algebra modulo N. Unpublished manuscript., December 1992.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9: 251-280, 1990.
4. s. Linear and Multilinear Algebra, 19: 67-77, 1986.
5. M. Newman. Integral Matrices. Academic Press, 1972.
6. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7: 281-292, 1971.
7. A. Storjohann and G. Labahn. Asymptotically fast computation of Hermite normal forms of integer matrices. In Y. N. Lakshman, editor, Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC'96, pages 259-266. ACM Press, 1996.