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 条

[1] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
洪加威
ScienceinChina,SerA., 1979, Ser.A.1979 (08) : 890 - 900
[2] LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
HONG, J
SCIENTIA SINICA, 1979, 22 (08): : 890 - 900
[3] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
洪加威
Science China Mathematics, 1979, (08) : 890 - 900
[4] LOWER BOUNDS FOR RESULTANTS .1.
EVERTSE, JH
GYORY, K
COMPOSITIO MATHEMATICA, 1993, 88 (01) : 1 - 23
[5] Lower Bounds on the Amortized Time Complexity of Shared Objects
Attiya, Hagit
Fouren, Arie
Ko, Jeremy
THEORY OF COMPUTING SYSTEMS, 2024, : 1372 - 1426
[6] Complete axiomatizations for reasoning about knowledge and time
Halpern, JY
Van der Meyden, R
Vardi, MY
SIAM JOURNAL ON COMPUTING, 2004, 33 (03) : 674 - 703
[7] ARE LOWER BOUNDS ON THE COMPLEXITY LOWER BOUNDS FOR UNIVERSAL CIRCUITS
NIGMATULLIN, RG
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 331 - 340
[8] 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
[9] Computational lower bounds using diagonalization: 1. Languages, Turing machines and complexity classes
Panduranga Rao M.V.
Resonance, 2009, 14 (7) : 682 - 690
[10] LOWER BOUNDS ON THE COMPLEXITY OF ONE TIME ONLY BRANCHING PROGRAMS
DUNNE, PE
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 90 - 99

← 1 2 3 4 5 →