Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time

被引：0
|
作者：
Chepurko, Nadiia [1 ]
Clarkson, Kenneth L. [2 ]
Kacham, Praneeth [3 ]
Woodru, David P. [3 ]
机构：
[1] Massachusetts Institute of Technology, United States
[2] Ibm Research Almaden
[3] Carnegie Mellon University, United States
来源：
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2022年 / 2022-January卷
关键词：
Number:; CCF-1815840; Acronym:; NSF; Sponsor: National Science Foundation; 5R01; HG; 10798-2; NIH; Sponsor: National Institutes of Health;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Embeddings
引用
收藏
页码：3043 / 3068
相关论文
共 50 条
  • [1] Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
    Chepurko, Nadiia
    Clarkson, Kenneth L.
    Kacham, Praneeth
    Woodruff, David P.
    [J]. PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 3043 - 3068
  • [2] NEAR-OPTIMAL ALGORITHMS FOR ONLINE MATRIX PREDICTION
    Hazan, Elad
    Kale, Satyen
    Shalev-Shwartz, Shai
    [J]. SIAM JOURNAL ON COMPUTING, 2017, 46 (02) : 744 - 773
  • [3] Near-optimal pricing in near-linear time
    Hartline, JD
    Koltun, V
    [J]. ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 422 - 431
  • [4] OPTIMAL AND NEAR-OPTIMAL SCHEDULING ALGORITHMS FOR BATCHED PROCESSING IN LINEAR STORAGE
    BITNER, JR
    WONG, CK
    [J]. SIAM JOURNAL ON COMPUTING, 1979, 8 (04) : 479 - 498
  • [5] Near-Optimal Sublinear Time Algorithms for Ulam Distance
    Andoni, Alexandr
    Nguyen, Huy L.
    [J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 76 - +
  • [6] Near-optimal linear space-time constellations
    Damen, MO
    El Gamal, H
    Beaulieu, NC
    [J]. 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 241 - 241
  • [7] Linear time near-optimal planning in the blocks world
    Slaney, J
    Thiébaux, S
    [J]. PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 1208 - 1214
  • [8] Near-optimal matrix recovery from random linear measurements
    Romanov, Elad
    Gavish, Matan
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2018, 115 (28) : 7200 - 7205
  • [9] SYNTHESIS OF AN OPTIMAL FAMILY OF MATRIX MULTIPLICATION ALGORITHMS ON LINEAR ARRAYS
    VARMAN, PJ
    RAMAKRISHNAN, IV
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (11) : 989 - 996
  • [10] Sparse vector linear prediction with near-optimal matrix structures
    Petrinovic, D
    Petrinovic, D
    [J]. IWISPA 2000: PROCEEDINGS OF THE FIRST INTERNATIONAL WORKSHOP ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS, 2000, : 235 - 240
12345