Back to Results
First PageMeta Content
Multilinear algebra / Numerical linear algebra / Binary operations / Matrix theory / Tensors / Tensor / Coppersmith–Winograd algorithm / Rank / Homogeneous polynomial / Algebra / Linear algebra / Mathematics


Fast Matrix Multiplication: Limitations of the Laser Method Andris Ambainis University of Latvia∗ Riga, Latvia
Add to Reading List

Document Date: 2014-11-19 16:56:27


Open Document

File Size: 477,94 KB

Share Result on Facebook

City

Riga / /

Country

Japan / United States / Latvia / /

/

Facility

Laser Method Andris Ambainis University of Latvia∗ Riga / Fran¸cois Le Gall The University of Tokyo Tokyo / Yuval Filmus Institute / /

IndustryTerm

latter algorithm / worse solutions / school algorithm / faster algorithms / even accounting / matrix multiplication algorithm / matrix product / approximate solution / tensor product / faster matrix multiplication algorithm / basis algorithm / mentioned algorithms / matrix multiplication algorithms / /

Organization

National Science Foundation / University of Latvia / University of Tokyo Tokyo / Institute for Advanced Study Princeton / Institute for Advanced Study / /

Person

Avi Wigderson / Edinah Gnang / /

ProgrammingLanguage

T / /

ProvinceOrState

New Jersey / /

Technology

previously mentioned algorithms / Laser / latter algorithm / high-school algorithm / even faster matrix multiplication algorithm / Winograd algorithm / improved algorithm / basis algorithm / known matrix multiplication algorithm / matrix multiplication algorithms / matrix multiplication algorithm / /

SocialTag