On the rank of random matrices

Random Structures and Algorithms

Volumn 16, Issue 2, 2000, Pages 209-232

  Cooper, C ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034387168     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200003)16:2<209::AID-RSA6>3.0.CO;2-1     Document Type: Article

References (8)

1. J. Blömer, R. Karp, and E. Welzl, The rank of sparse random matrices over finite fields, Random Struct Alg, 10(4) (1997), 407-419.
2. P.J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge Univ. Press, Cambridge, UK, 1994.
3. R. Durrett, Probability: Theory and Examples, Wadsworth, Belmont, CA, 1991.
4. V. Kolchin, Random graphs and systems of linear equations in finite fields, Random Struct Alg, 5(1) (1994), 135-146.
5. D.E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, 1973.
6. I.N. Kovalenko, A.A. Levitskya, and M.N. Savchuk, Selected Problems in Probabilistic Combinatorics, Naukova Dumka, Kiev, 1986 (in Russian).
7. J.H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge Univ. Press, Cambridge, UK, 1992.
8. E.M. Palmer, Graphical Evolution, Wiley-Interscience, New York, 1985.