On the geometry of border rank algorithms for n x 2 by 2 x 2 matrix multiplication
Abstract
We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.