Abstract
ABSTRACTWe 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
