Matrix multiplication verification using coding theory
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3635490 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- A note on compressed sensing and the complexity of matrix multiplication
- A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Efficiently correcting matrix products
- Faster matrix multiplication via asymmetric hashing
- Faster rectangular matrix multiplication by combination loss analysis
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Lattice problems beyond polynomial time
- Local reductions
- New bounds for matrix multiplication: from alpha to omega
- On MDS codes via Cauchy matrices
- On nondeterministic derandomization of Freivalds' algorithm: consequences, avenues and algorithmic progress
- Polynomial formulations as a barrier for reduction-based hardness proofs
- The time complexity of fully sparse matrix multiplication
- Verifying the product of generalized Boolean matrix multiplication and its applications to detect small subgraphs
This page was built for publication: Matrix multiplication verification using coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920798)
