Algorithm for finding discrete approximations of small multiplication tensors.
-
Updated
Aug 19, 2021 - Fortran
Algorithm for finding discrete approximations of small multiplication tensors.
Add a description, image, and links to the fast-multiplication topic page so that developers can more easily learn about it.
To associate your repository with the fast-multiplication topic, visit your repo's landing page and select "manage topics."