A NOTE ON DETERMINISTIC AND NONDETERMINISTIC TIME-COMPLEXITY

被引：2
|
作者：
EVEN, S
LONG, TJ
YACOBI, Y
机构：
[1] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL
[2] NEW MEXICO STATE UNIV,DEPT COMP SCI,LAS CRUCES,NM 88003
来源：
INFORMATION AND CONTROL | 1982年 / 55卷 / 1-3期
关键词：
D O I：
10.1016/S0019-9958(82)90515-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：117 / 124
页数：8
相关论文
共 50 条
  • [41] EXPECTED TIME-COMPLEXITY OF A NEW CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS
    VANDERNAT, M
    ANGEWANDTE INFORMATIK, 1987, (12): : 533 - 536
  • [42] ALMOST-EVERYWHERE COMPLEXITY HIERARCHIES FOR NONDETERMINISTIC TIME
    ALLENDER, E
    BEIGEL, R
    HERTRAMPF, U
    HOMER, S
    THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) : 225 - 241
  • [43] Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes
    Ostonov, Azimkhon
    Moshkov, Mikhail
    IEEE Access, 2024, 12 : 164979 - 164988
  • [44] Deterministic realizations of nondeterministic automata
    Lukyanov, BD
    CYBERNETICS AND SYSTEMS ANALYSIS, 1996, 32 (04) : 493 - 504
  • [45] On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
    Ostonov, Azimkhon
    Moshkov, Mikhail
    ENTROPY, 2023, 25 (10)
  • [46] DETERMINISTIC AND NONDETERMINISTIC FLOWCHART INTERPRETATIONS
    LORENTZ, RJ
    BENSON, DB
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 27 (03) : 400 - 433
  • [47] ON THE DETERMINISTIC AND NONDETERMINISTIC MUELLER MATRIX
    XING, ZF
    JOURNAL OF MODERN OPTICS, 1992, 39 (03) : 461 - 484
  • [48] A NOTE ON THE ALMOST-EVERYWHERE HIERARCHY FOR NONDETERMINISTIC TIME
    ALLENDER, E
    BEIGEL, R
    HERTRAMPF, U
    HOMER, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 415 : 1 - 9
  • [49] Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
    Klin, Bartek
    Lasota, Slawomir
    Torunczyk, Szymon
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 2021, 12650 : 365 - 384
  • [50] Descriptive Complexity of Deterministic Polylogarithmic Time
    Ferrarotti, Flavio
    Gonzalez, Senen
    Torres, Jose Maria Turull
    Van den Bussche, Jan
    Virtema, Jonni
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION (WOLLIC 2019), 2019, 11541 : 208 - 222
12345