On the complexity of matrix reduction over finite fields

Advances in Applied Mathematics

Volumn 39, Issue 4, 2007, Pages 428-452

  Andrén, Daniel ^a   Hellström, Lars ^a   Markström, Klas ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

Complexity; Finite fields; Matrix reduction; Semifields

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

ELEMENTARY MATRICES; FINITE FIELDS; MATRIX REDUCTION; RANDOM MATRICES;

MATRIX ALGEBRA;

EID: 34548563891     PISSN: 01968858     EISSN: 10902074     Source Type: Journal    
DOI: 10.1016/j.aam.2006.08.008     Document Type: Article

References (23)

1. Bunch J.R., and Hopcroft J.E. Triangular factorization and inversion by fast matrix multiplication. Math. Comp. 28 (1974) 231-236
2. Bürgisser P., Clausen M., and Amin Shokrollahi M. Algebraic Complexity Theory. Grundlehren Math. Wiss. vol. 315 (1997), Springer, Berlin
3. Crandall R., and Pomerance C. Prime Numbers, A Computational Perspective. second ed. (2005), Springer, New York
4. Euler L. De mirabilis proprietatibus numerorum pentagonalium. Acta Academiae Scientarum Imperialis Petropolitinae 4 (1783) 56-75
5. Gowers W.T. Rough structure and classification. Proc. GAFA 2000, Tel Aviv, 1999, Part I. Geom. Funct. Anal. Special Volume (2000) 79-117
6. Harris J. Algebraic Geometry. Grad. Texts in Math. vol. 133 (1995), Springer, New York
7. n (Z / k Z) (2005). http://arXiv.org:math/0502221
8. Kleinfeld E. Techniques for enumerating Veblen-Wedderburn systems. J. ACM 7 (1960) 330-337
9. Knuth D.E. Finite semifields and projective planes. J. Algebra 2 (1965) 182-217
10. Knuth D.E. The Art of Computer Programming, vol. 4, fasc. 2: Generating All Tuples and Permutations. first ed. (2005), Wiley-Interscience, New York
11. Lauri J., and Scapellato R. Topics in Graph Automorphisms and Reconstruction (2003), Cambridge Univ. Press, Cambridge
12. Lenstra A.K., Lenstra Jr. H.W., Manasse M.S., and Pollard J.M. The factorization of the ninth Fermat number. Math. Comp. 61 203 (1993) 319-349
13. Liebeck M.W., and Shalev A. Diameters of finite simple groups: sharp bounds and applications. Ann. of Math. (2) 154 (2001) 383-406
14. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge Univ. Press, Cambridge
15. Nagura J. On the interval containing at least one prime number. Proc. Japan Acad. 28 (1952) 177-181
16. Odlyzko A.M. Discrete logarithms in finite fields and their cryptographic significance. Advances in Cryptology. Paris, 1984. Lecture Notes in Comput. Sci. vol. 209 (1985), Springer, Berlin 224-314
17. Pippenger N. On the evaluation of powers and related problems (preliminary version). 17th Annual Symposium on Foundations of Computer Science. Houston, TX, 1976 (1976), IEEE Comput. Soc., Long Beach, CA 258-263
18. Pippenger N. The minimum number of edges in graphs with prescribed paths. Math. Systems Theory 12 (1979) 325-346
19. Pippenger N. On the evaluation of powers and monomials. SIAM J. Comput. 9 (1980) 230-250
20. Pomerance C., and Smith J.W. Reduction of huge, sparse matrices over finite fields via created catastrophes. Experiment. Math. 1 (1992) 89-94
21. p), 2005
22. van Lint J.H., and Wilson R.M. A Course in Combinatorics. second ed. (2001), Cambridge Univ. Press, Cambridge
23. A. Wigderson, Arithmetic complexity-a survey (lecture notes), 2001