Efficiently-verifiable strong uniquely solvable puzzles and matrix multiplication
From MaRDI portal
Publication:6591619
DOI10.1007/978-3-031-49193-1_4MaRDI QIDQ6591619
Vu Tuan Hieu Le, Matthew W. Anderson
Publication date: 22 August 2024
arithmetic complexitymatrix multiplicationiterative local search3D matchingsimplifiable strong uniquely solvable puzzle
Cites Work
- Title not available (Why is that?)
- On sunflowers and matrix multiplication
- Finding all maximally-matchable edges in a bipartite graph
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Matrix multiplication via arithmetic progressions
- Gaussian elimination is not optimal
- Matrix multiplication: verifying strong uniquely solvable puzzles
- Improved bound for complexity of matrix multiplication
- Further Limitations of the Known Approaches for Matrix Multiplication
- Discovering faster matrix multiplication algorithms with reinforcement learning
This page was built for publication: Efficiently-verifiable strong uniquely solvable puzzles and matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591619)
