Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
From MaRDI portal
Publication:5285856
DOI10.1080/10586458.1992.10504250zbMath0771.65023OpenAlexW2053148809MaRDI 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
reductionfinite fieldsGaussian eliminationcreated catastropheshuge, sparse matriceslarge, sparse bit matrix
Related Items
Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs ⋮ The Factorization of the Ninth Fermat Number ⋮ An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic ⋮ On the complexity of matrix reduction over finite fields ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ Cohomology of congruence subgroups of $ {SL}_4(\mathbb {Z})$. III ⋮ Theory and applications of Raptor codes ⋮ Factoring with Two Large Primes
Cites Work