Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
From MaRDI portal
Publication:5285856
DOI10.1080/10586458.1992.10504250zbMath0771.65023MaRDI QIDQ5285856
No author found.
Publication date: 29 June 1993
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1048709047
reduction; finite fields; Gaussian elimination; created catastrophes; huge, sparse matrices; large, sparse bit matrix
65F50: Computational methods for sparse matrices
Related Items
Factoring with Two Large Primes, Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, On the complexity of matrix reduction over finite fields, The Factorization of the Ninth Fermat Number, Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III
Cites Work