THE LOWER BOUNDS ON THE ADDITIVE COMPLEXITY OF BILINEAR PROBLEMS IN TERMS OF SOME ALGEBRAIC QUANTITIES

被引：1
|
作者：
PAN, VY [1 ]
机构：
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
来源：
INFORMATION PROCESSING LETTERS | 1981年 / 13卷 / 02期
关键词：
D O I：
10.1016/0020-0190(81)90035-1
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：71 / 72
页数：2
相关论文
共 50 条
  • [1] Lower bounds for query complexity of some graph problems
    Lace, L
    Freivalds, R
    [J]. VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 309 - 313
  • [2] Lower bounds for the bilinear complexity of associative algebras
    Bläser, M
    [J]. COMPUTATIONAL COMPLEXITY, 2000, 9 (02) : 73 - 112
  • [3] Lower bounds for the bilinear complexity of associative algebras
    M. Bläser
    [J]. computational complexity, 2000, 9 : 73 - 112
  • [4] Some graph problems with equivalent lower bounds for query complexity
    Láce, L
    Praude, R
    Freivalds, R
    [J]. FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 80 - 86
  • [5] Lower bounds on the bounded coefficient complexity of bilinear maps
    Bürgisser, P
    Lotz, M
    [J]. JOURNAL OF THE ACM, 2004, 51 (03) : 464 - 482
  • [6] Lower bounds on the bounded coefficient complexity of bilinear maps
    Bürgisser, P
    Lotz, M
    [J]. FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 659 - 668
  • [7] Lower bounds for dynamic algebraic problems
    Frandsen, GS
    Hansen, JP
    Miltersen, PB
    [J]. INFORMATION AND COMPUTATION, 2001, 171 (02) : 333 - 349
  • [8] Lower bounds for dynamic algebraic problems
    Frandsen, GS
    Hansen, JP
    Miltersen, PB
    [J]. STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 362 - 372
  • [9] Proof Complexity Lower Bounds from Algebraic Circuit Complexity
    Forbes, Michael A.
    Shpilka, Amir
    Tzameret, Iddo
    Wigderson, Avi
    [J]. THEORY OF COMPUTING, 2021, 17 (17)
  • [10] Proof Complexity Lower Bounds from Algebraic Circuit Complexity
    Forbes, Michael A.
    Shpilka, Amir
    Tzameret, Iddo
    Wigderson, Avi
    [J]. 31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
12345