On wiedemann's method of solving sparse linear systems
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Solving Large Sparse Linear Systems Over Finite FieldsPublished by Springer Nature ,2001
- Processor efficient parallel solution of linear systems over an abstract fieldPublished by Association for Computing Machinery (ACM) ,1991
- Costs of quadtree representation of nondense matricesJournal of Parallel and Distributed Computing, 1990
- Addition requirements for matrix and transposed matrix productsJournal of Algorithms, 1988
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Generalized Nested DissectionSIAM Journal on Numerical Analysis, 1979
- Probabilistic algorithms for sparse polynomialsPublished by Springer Nature ,1979
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Optimal Rearrangeable Multistage Connecting NetworksBell System Technical Journal, 1964