@article{Landsberg_2017,
    doi = {10.1093/imrn/rnx025},
    url = {https://doi.org/10.1093%2Fimrn%2Frnx025},
    year = {2017},
    month = {mar},
    publisher = {Oxford University Press ({OUP})},
    volume = {2018},
    number = {15},
    pages = {4722--4733},
    author = {Joseph M Landsberg and Mateusz Micha{\l}ek},
    title = {A {\textdollar}2$\lbrace${\textbackslash}mathbf$\lbrace$n$\rbrace$$\rbrace${\^{}}2-$\lbrace${\textbackslash}text$\lbrace$log$\rbrace$$\rbrace${\_}2($\lbrace${\textbackslash}mathbf$\lbrace$n$\rbrace$$\rbrace$)-1{\textdollar} lower bound for the border rank of matrix multiplication},
    journal = {International Mathematics Research Notices}
}

@article{Landsberg_2017, doi = {10.1093/imrn/rnx025}, url = {https://doi.org/10.1093%2Fimrn%2Frnx025}, year = {2017}, month = {mar}, publisher = {Oxford University Press ({OUP})}, volume = {2018}, number = {15}, pages = {4722--4733}, author = {Joseph M Landsberg and Mateusz Micha{\l}ek}, title = {A {\textdollar}2$\lbrace${\textbackslash}mathbf$\lbrace$n$\rbrace$$\rbrace${\^{}}2-$\lbrace${\textbackslash}text$\lbrace$log$\rbrace$$\rbrace${_}2($\lbrace${\textbackslash}mathbf$\lbrace$n$\rbrace$$\rbrace$)-1{\textdollar} lower bound for the border rank of matrix multiplication}, journal = {International Mathematics Research Notices} }

Library Size: 13G (12941 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge