Algorithm 898
From MaRDI portal
Recommendations
- Fast matrix multiplication and its algebraic neighbourhood
- On practical algorithms for accelerated matrix multiplication
- A practical algorithm for faster matrix multiplication
- On an optimal algorithm for matrix multiplication
- Publication:4944595
- On the complexity of some algorithms of matrix multiplication
- An efficient algorithm for multiplying a large circulant matrix by a column
- On transformations of algorithms to multiply 2 2 matrices
- An optimal algorithm for matrix multiplication
- scientific article; zbMATH DE number 1022807
Cited in
(17)- Optimizing matrix operations in \(\mathbb Z_2\) by word packing
- Construction of the irreducible modular representations of a finite group
- GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\)
- Fast matrix decomposition in F₂
- Algorithm 898
- On the arithmetic complexity of Strassen-like matrix multiplications
- FFPACK
- The M4RIE library for dense linear algebra over small fields with even characteristic
- Generic matrix multiplication and memory management in LinBox
- Complexity Reduction of Constant Matrix Computations over the Binary Field
- Formal languages over GF(2)
- OnionPIR: effective protection of sensitive metadata in online communication networks
- Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
- A parallel algorithm for Gaussian elimination over finite fields
- A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra
- A framework to optimize implementations of matrices
- On self-equivalence encodings in white-box implementations
This page was built for publication: Algorithm 898
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989091)
