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 条
  • [41] Some lower bounds for the complexity of the linear programming feasibility problem over the reals
    Grimson, Rafael
    Kuijpers, Bart
    JOURNAL OF COMPLEXITY, 2009, 25 (01) : 25 - 37
  • [42] THE LOWER BOUNDS ON THE ADDITIVE COMPLEXITY OF BILINEAR PROBLEMS IN TERMS OF SOME ALGEBRAIC QUANTITIES
    PAN, VY
    INFORMATION PROCESSING LETTERS, 1981, 13 (02) : 71 - 72
  • [43] Lower complexity bounds in justification logic
    Buss, Samuel R.
    Kuznets, Roman
    ANNALS OF PURE AND APPLIED LOGIC, 2012, 163 (07) : 888 - 905
  • [44] LOWER BOUNDS BY KOLMOGOROV-COMPLEXITY
    LI, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 194 : 383 - 393
  • [45] Propositional lower bounds: Algorithms and complexity
    Cadoli, M
    Palopoli, L
    Scarcello, F
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 27 (1-4) : 129 - 148
  • [46] Lower complexity bounds for interpolation algorithms
    Gimenez, Nardo
    Heintz, Joos
    Matera, Guillermo
    Solerno, Pablo
    JOURNAL OF COMPLEXITY, 2011, 27 (02) : 151 - 187
  • [47] LOWER BOUNDS OF THE COMPLEXITY OF LINEAR ALGEBRAS
    BINI, D
    CAPOVANI, M
    INFORMATION PROCESSING LETTERS, 1979, 9 (01) : 46 - 47
  • [48] Lower bounds for quantum communication complexity
    Klauck, H
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 288 - 297
  • [49] LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY
    Toran, Jacobo
    Hoyer, Peter
    Spalek, Robert
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 78 - 103
  • [50] Complexity lower bounds for polygonal billiards
    Troubetzkoy, S
    CHAOS, 1998, 8 (01) : 242 - 244
12345