EFFECTIVE LOWER BOUNDS FOR COMPLEXITY OF SOME CLASSES OF SCHEMES

被引：0
|
作者：
ANDREEV, AE
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1987年 / 278卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：24 / 29
页数：6
相关论文
共 50 条
  • [21] Some graph problems with equivalent lower bounds for query complexity
    Láce, L
    Praude, R
    Freivalds, R
    FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 80 - 86
  • [22] LOWER BOUNDS ON THE COMPLEXITY OF SOME OPTIMAL DATA-STRUCTURES
    FREDMAN, ML
    SIAM JOURNAL ON COMPUTING, 1981, 10 (01) : 1 - 10
  • [23] Upper and lower bounds for some depth-3 circuit classes
    Beigel, R
    Maciel, A
    TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1997, : 149 - 157
  • [24] Upper and lower bounds for some depth-3 circuit classes
    Beigel, R
    Maciel, A
    COMPUTATIONAL COMPLEXITY, 1997, 6 (03) : 235 - 255
  • [25] Lower bounds for the colored mixed chromatic number of some classes of graphs
    Fabila-Monroy, R.
    Flores, D.
    Huemer, C.
    Montejano, A.
    COMMENTATIONES MATHEMATICAE UNIVERSITATIS CAROLINAE, 2008, 49 (04): : 637 - 645
  • [26] Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes
    Liskiewicz, M
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 129 - 140
  • [27] Lower Bounds in Communication Complexity
    Lee, Troy
    Shraibman, Adi
    FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2007, 3 (04): : 263 - 399
  • [28] LOWER BOUNDS FOR THE APPROXIMATIVE COMPLEXITY
    GRIESSER, B
    THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 329 - 338
  • [29] Lower bounds for topological complexity
    Franc, Aleksandra
    Pavesic, Petar
    TOPOLOGY AND ITS APPLICATIONS, 2013, 160 (08) : 991 - 1004
  • [30] LOWER BOUNDS ON COMMUNICATION COMPLEXITY
    DURIS, P
    GALIL, Z
    SCHNITGER, G
    INFORMATION AND COMPUTATION, 1987, 73 (01) : 1 - 22
12345