A NOTE ON THE DENSITY OF ORACLE DECREASING TIME-SPACE COMPLEXITY

被引：0
|
作者：
DURIS, P [1 ]
ROLIM, JDP [1 ]
机构：
[1] UNIV GENEVA, CTR UNIV INFORMAT, CH-1211 GENEVA, SWITZERLAND
来源：
THEORETICAL COMPUTER SCIENCE | 1994年 / 132卷 / 1-2期
关键词：
D O I：
10.1016/0304-3975(94)00072-7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we study bounds on the density of oracles which can help to decrease the time-space complexity of recognition of a particular language by off-line multitape Turing machines. We establish an upper and a lower bound on the density of such oracles which are optimal up to a multiplicative constant and improve the bounds stated by Hromkovic (1991).
引用
收藏
页码：435 / 444
页数：10
相关论文
共 50 条
  • [1] On the time-space complexity of geometric elimination procedures
    Heintz, J
    Matera, G
    Waissbein, A
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 11 (04) : 239 - 296
  • [2] Time-Space Complexity Advantages for Quantum Computing
    Zheng, Shenggen
    Qiu, Daowen
    Gruska, Jozef
    THEORY AND PRACTICE OF NATURAL COMPUTING, TPNC 2017, 2017, 10687 : 305 - 317
  • [3] Time-space tradeoffs in algebraic complexity theory
    Aldaz, M
    Heintz, J
    Matera, G
    Montaña, JL
    Pardo, LM
    JOURNAL OF COMPLEXITY, 2000, 16 (01) : 2 - 49
  • [4] INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY
    FORTNOW, L
    LUND, C
    THEORETICAL COMPUTER SCIENCE, 1993, 113 (01) : 55 - 73
  • [5] ON THE TIME-SPACE COMPLEXITY OF REACHABILITY QUERIES FOR PREPROCESSED GRAPHS
    HELLERSTEIN, L
    KLEIN, P
    WILBER, R
    INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 261 - 267
  • [6] Implicit computational complexity and the exponential time-space classes
    Caporaso, Salvatore
    Covino, Emanuele
    Gissi, Paolo
    Pani, Giovanni
    PROCEEDINGS OF THE 6TH WSEAS INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND INFORMATICS (TELE-INFO '07)/ 6TH WSEAS INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING (SIP '07), 2007, : 65 - +
  • [7] The paradoxical habits of busyness and the complexity of intimate time-space
    Holdsworth, Clare
    SOCIAL & CULTURAL GEOGRAPHY, 2022, 23 (04) : 485 - 501
  • [8] INTERACTIVE PROOF SYSTEMS AND ALTERNATING TIME-SPACE COMPLEXITY
    FORTNOW, L
    LUND, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 263 - 274
  • [9] A NOTE ON BENNETT TIME-SPACE TRADEOFF FOR REVERSIBLE COMPUTATION
    LEVINE, RY
    SHERMAN, AT
    SIAM JOURNAL ON COMPUTING, 1990, 19 (04) : 673 - 677
  • [10] Synthetic methodologies for an optimal time-space algorithm complexity distribution
    Bekakos, MP
    APPLICATIONS OF HIGH-PERFORMANCE COMPUTING IN ENGINEERING VI, 2000, 6 : 179 - 190
12345