Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Fast rectangular matrix multiplications and improving parallel matrix computations
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms
PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems
On parallel block algorithms for exact triangularizations
Parallel Computing
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On the complexity of polynomial matrix computations
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Black box linear algebra with the linbox library
Black box linear algebra with the linbox library
Self-adapting numerical software and automatic tuning of heuristics
ICCS'03 Proceedings of the 2003 international conference on Computational science
Self-adapting numerical software and automatic tuning of heuristics
ICCS'03 Proceedings of the 2003 international conference on Computational science
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Generic matrix multiplication and memory management in linBox
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Half-GCD and fast rational recovery
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Algorithms for symbolic/numeric control of affine dynamical systems
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Communication-efficient parallel generic pairwise elimination
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Efficient matrix rank computation with application to the study of strongly regular graphs
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Faster algorithms for the characteristic polynomial
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Applying linear algebra routines to modular ore polynomial matrix algorithms
ACM Communications in Computer Algebra
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Simultaneous modular reduction and Kronecker substitution for small finite fields
Journal of Symbolic Computation
Surface patches from unorganized space curves
Proceedings of the twenty-eighth annual symposium on Computational geometry
The M4RIE library for dense linear algebra over small fields with even characteristic
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many algorithms have been reduced to use matrix multiplication in order to be able to prove an optimal theoretical complexity, this paper shows that those optimal complexity algorithms, such as LSP factorization, rank determinant and inverse computation can also be the most efficient.