LOWER BOUNDS BY KOLMOGOROV-COMPLEXITY

被引:0
|
作者
LI, M
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:383 / 393
页数:11
相关论文
共 50 条
  • [31] Lower bounds for the transition complexity of NFAs
    Domaratzki, Michael
    Salomaa, Kai
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 315 - 326
  • [32] Lower bounds for the transition complexity of NFAs
    Domaratzki, Michael
    Salomaa, Kai
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (07) : 1116 - 1130
  • [33] LOWER BOUNDS ON SYNCHRONOUS COMBINATIONAL COMPLEXITY
    HARPER, LH
    SAVAGE, JE
    SIAM JOURNAL ON COMPUTING, 1979, 8 (02) : 115 - 119
  • [34] Communication complexity lower bounds by polynomials
    Buhrman, H
    de Wolf, R
    16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 120 - 130
  • [35] Proof Complexity Lower Bounds from Algebraic Circuit Complexity
    Forbes, Michael A.
    Shpilka, Amir
    Tzameret, Iddo
    Wigderson, Avi
    THEORY OF COMPUTING, 2021, 17 (17)
  • [36] Proof Complexity Lower Bounds from Algebraic Circuit Complexity
    Forbes, Michael A.
    Shpilka, Amir
    Tzameret, Iddo
    Wigderson, Avi
    31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
  • [37] Lower bounds for the multiplicative complexity of matrix multiplication
    M. Bläser
    computational complexity, 1999, 8 : 203 - 226
  • [38] LOWER BOUNDS TO THE COMPLEXITY OF SYMMETRICAL BOOLEAN FUNCTIONS
    BABAI, L
    PUDLAK, P
    RODL, V
    SZEMEREDI, E
    THEORETICAL COMPUTER SCIENCE, 1990, 74 (03) : 313 - 323
  • [39] Lower Bounds for Runtime Complexity of Term Rewriting
    Frohn, Florian
    Giesl, Juergen
    Hensel, Jera
    Aschermann, Cornelius
    Stroeder, Thomas
    JOURNAL OF AUTOMATED REASONING, 2017, 59 (01) : 121 - 163
  • [40] Some lower bounds for the complexity of continuation methods
    LAO, Université Paul Sabatier, 31062 Toulouse Cedex 04, France
    不详
    J. Complexity, 4 (454-465):