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 × 2 matrix by a… Click to show full abstract
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 × 2 matrix by a 2 × 2 matrix.
               
Click one of the above tabs to view related content.