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 条
  • [31] LOWER BOUNDS FOR THE COMPLEXITY OF POLYNOMIALS
    STOSS, HJ
    THEORETICAL COMPUTER SCIENCE, 1989, 64 (01) : 15 - 23
  • [32] LOWER BOUNDS ON THE WORST-CASE COMPLEXITY OF SOME ORACLE ALGORITHMS
    HAUSMANN, D
    KORTE, B
    DISCRETE MATHEMATICS, 1978, 24 (03) : 261 - 276
  • [33] LOWER BOUNDS ON TIME COMPLEXITY FOR SOME SUBGRAPH DETECTION PROBLEMS.
    Arai, Masanari
    Yamashita, Masafumi
    Hirata, Tomio
    Ibaraki, Toshihide
    Honda, Namio
    Systems and Computers in Japan, 1986, 17 (06) : 95 - 102
  • [34] Exponential lower bounds on the lengths of some classes of branch-and-cut proofs
    Dash, S
    MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (03) : 678 - 700
  • [35] The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
    Goessmann, Ina
    Klawitter, Jonathan
    Klemz, Boris
    Klesen, Felix
    Kobourov, Stephen
    Kryven, Myroslav
    Wolff, Alexander
    Zink, Johannes
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 271 - 286
  • [36] Weak Lower Bounds on Resource-Bounded Compression Imply Strong Separations of Complexity Classes
    McKay, Dylan M.
    Murray, Cody D.
    Williams, R. Ryan
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 1215 - 1225
  • [37] Computational lower bounds using diagonalization: 1. Languages, Turing machines and complexity classes
    Panduranga Rao M.V.
    Resonance, 2009, 14 (7) : 682 - 690
  • [38] Computational Lower Bounds Using Diagonalization 1. Languages, Turing Machines and Complexity Classes
    Rao, M. V. Panduranga
    RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2009, 14 (07): : 682 - 690
  • [39] HONEST BOUNDS FOR COMPLEXITY CLASSES OF RECURSIVE FUNCTIONS
    MOLL, R
    MEYER, AR
    JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (01) : 127 - 138
  • [40] New bounds on the communication complexity of metering schemes
    Blundo, C
    Martín, S
    Masucci, B
    Padrò, C
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 438 - 438
12345