Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
- 1 May 2002
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 33 (5) , 757-775
- https://doi.org/10.1006/jsco.2002.0533
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- ON THE COMPLEXITY OF COMPUTING DETERMINANTSPublished by World Scientific Pub Co Pte Ltd ,2001
- Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite FieldsAlgorithmica, 1999
- A Uniform Approach for the Fast Computation of Matrix-Type Padé ApproximantsSIAM Journal on Matrix Analysis and Applications, 1994
- Solving linear equations over GF(2): block Lanczos algorithmLinear Algebra and its Applications, 1993
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created CatastrophesExperimental Mathematics, 1992
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Asymptotically fast solution of toeplitz and related systems of linear equationsLinear Algebra and its Applications, 1980
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systemsIEEE Transactions on Circuits and Systems, 1979