THE COMPLEXITY OF REASONING ABOUT KNOWLEDGE AND TIME .1. LOWER BOUNDS

被引：121
|
作者：
HALPERN, JY
VARDI, MY
机构：
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1989年 / 38卷 / 01期
关键词：
D O I：
10.1016/0022-0000(89)90039-1
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：195 / 237
页数：43
相关论文
共 50 条
  • [31] Complexity lower bounds for polygonal billiards
    Troubetzkoy, S
    CHAOS, 1998, 8 (01) : 242 - 244
  • [32] Lower bounds on the multiparty communication complexity
    Duris, P
    Rolim, JDP
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (01) : 90 - 95
  • [33] Lower complexity bounds for interpolation algorithms
    Gimenez, Nardo
    Heintz, Joos
    Matera, Guillermo
    Solerno, Pablo
    JOURNAL OF COMPLEXITY, 2011, 27 (02) : 151 - 187
  • [34] LOWER BOUNDS OF THE COMPLEXITY OF LINEAR ALGEBRAS
    BINI, D
    CAPOVANI, M
    INFORMATION PROCESSING LETTERS, 1979, 9 (01) : 46 - 47
  • [35] Propositional lower bounds: Algorithms and complexity
    Cadoli, M
    Palopoli, L
    Scarcello, F
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 27 (1-4) : 129 - 148
  • [36] LOWER COMPLEXITY BOUNDS FOR POSITIVE CONTACTOMORPHISMS
    Dahinden, Lucas
    ISRAEL JOURNAL OF MATHEMATICS, 2018, 224 (01) : 367 - 383
  • [37] LOWER BOUNDS ON THE COMPLEXITY OF LOCAL CIRCUITS
    JUKNA, SP
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 440 - 448
  • [38] Lower complexity bounds for positive contactomorphisms
    Lucas Dahinden
    Israel Journal of Mathematics, 2018, 224 : 367 - 383
  • [39] Lower bounds for quantum communication complexity
    Klauck, Hartmut
    SIAM JOURNAL ON COMPUTING, 2007, 37 (01) : 20 - 46
  • [40] Tight Lower Bounds for the Complexity of Multicoloring
    Bonamy, Marthe
    Kowalik, Lukasz
    Pilipczuk, Michal
    Socala, Arkadiusz
    Wrochna, Marcin
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (03)
12345