An Approximate Probabilistic Model for Structured Gaussian Elimination

Journal of Algorithms

Volumn 31, Issue 2, 1999, Pages 271-290

  Bender, Edward A ^a   Canfield, E Rodney ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Georgia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347038905     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1008     Document Type: Article

References (3)

1. T. E. Harris, "The Theory of Branching Processes," Dover, New York, 1989.
2. B. A. LaMacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields, in "Advances in Cryptology-CRYPTO '90" (A. J. Menezes and S. A. Vanstone, Eds.), Lecture Notes in Computer Science, Vol. 537, pp. 109-133, Springer-Verlag, Berlin, 1991.
3. C. Pomerance and J. W. Smith, Reduction of huge, sparse matrices over finite fields via created catastrophes, Exper. Math. 1 (1992), 89-94.