Uniquely Solvable Puzzles and Fast Matrix Multiplication
In 2003 Cohn and Umans introduced a new group-theoretic framework for doing fast matrix multiplications, with several conjectures that would imply the matrix multiplication exponent $\omega$ is 2. Their methods have been used to match one of the fastest known algorithms by Coppersmith and Winograd,...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2012
|
| Subjects: | |
| Online Access: | https://scholarship.claremont.edu/hmc_theses/37 https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1036&context=hmc_theses |