New lower bounds for the border rank of matrix multiplication

被引：0
|
作者：
Landsberg, Joseph M. [1 ]
Ottaviani, Giorgio [2 ]
机构：
[1] Texas A and M University, College Station,TX, United States
[2] Università di Firenze, Firenze, Italy
来源：
Theory of Computing | 2015年 / 11卷
关键词：
∗Supported by NSF grant DMS-1006353. †Member of GNSAGA-INDAM;
D O I：
10.4086/toc.2015.v011a011
中图分类号：
学科分类号：
摘要：
25
引用
收藏
页码：285 / 298
相关论文
共 50 条
  • [1] NEW LOWER BOUNDS FOR THE RANK OF MATRIX MULTIPLICATION
    Landsberg, J. M.
    [J]. SIAM JOURNAL ON COMPUTING, 2014, 43 (01) : 144 - 149
  • [2] Equations for Lower Bounds on Border Rank
    Hauenstein, Jonathan D.
    Ikenmeyer, Christian
    Landsberg, J. M.
    [J]. EXPERIMENTAL MATHEMATICS, 2013, 22 (04) : 372 - 383
  • [3] New lower bounds for matrix multiplication and $\operatorname {det}_3$
    Conner, Austin
    Harper, Alicia
    Landsberg, J. M.
    [J]. FORUM OF MATHEMATICS PI, 2023, 11
  • [4] NOTE ON LOWER BOUNDS FOR THE RANK OF A MATRIX
    CHEN, G
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1983, 55 (DEC) : 125 - 132
  • [5] Lower bounds for the multiplicative complexity of matrix multiplication
    M. Bläser
    [J]. computational complexity, 1999, 8 : 203 - 226
  • [6] Lower bounds for the multiplicative complexity of matrix multiplication
    Bläser, M
    [J]. COMPUTATIONAL COMPLEXITY, 1999, 8 (03) : 203 - 226
  • [7] Effective Lower Bounds on the Matrix Rank and Their Applications
    Zverkov, O. A.
    Seliverstov, A. V.
    [J]. PROGRAMMING AND COMPUTER SOFTWARE, 2023, 49 (05) : 441 - 447
  • [8] Effective Lower Bounds on the Matrix Rank and Their Applications
    O. A. Zverkov
    A. V. Seliverstov
    [J]. Programming and Computer Software, 2023, 49 : 441 - 447
  • [9] IMPROVED LOWER BOUNDS FOR SOME MATRIX MULTIPLICATION PROBLEMS
    JAJA, J
    TAKCHE, J
    [J]. INFORMATION PROCESSING LETTERS, 1985, 21 (03) : 123 - 127
  • [10] Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
    Das, Debarati
    Koucky, Michal
    Saks, Michael
    [J]. 35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
12345