ON REVERSAL COMPLEXITY FOR ALTERNATING TURING-MACHINES

被引：0

|

作者：

LISKIEWICZ, M

LORYS, K

机构：

来源：

30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE | 1989年

关键词：

D O I：

10.1109/SFCS.1989.63544

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

下载

收藏

页码：618 / 623

页数：6

相关论文

共 50 条

[41] ON THE OPERATING TIME OF ERRORLESS PROBABILISTIC TURING-MACHINES
FREIVALD, RV
THEORY OF PROBABILITY AND ITS APPLICATIONS, 1988, 32 (03) : 514 - 516
[42] LEAF REDUCTION THEOREM ON TIME-BOUNDED AND LEAF-BOUNDED ALTERNATING TURING-MACHINES
YAMAMOTO, H
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1992, E75D (01) : 133 - 140
[43] THE COMPLEXITY OF MATRIX TRANSPOSITION ON ONE-TAPE OFF-LINE TURING-MACHINES
DIETZFELBINGER, M
MAASS, W
SCHNITGER, G
THEORETICAL COMPUTER SCIENCE, 1991, 82 (01) : 113 - 129
[44] CHEMICAL IMPLEMENTATION OF NEURAL NETWORKS AND TURING-MACHINES
HJELMFELT, A
WEINBERGER, ED
ROSS, J
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1991, 88 (24) : 10983 - 10987
[45] UNBOUNDED HARDWARE IS EQUIVALENT TO DETERMINISTIC TURING-MACHINES
CHAZELLE, B
MONIER, L
THEORETICAL COMPUTER SCIENCE, 1983, 24 (02) : 123 - 130
[46] SPEEDUP OF DETERMINISM BY ALTERNATION FOR MULTIDIMENSIONAL TURING-MACHINES
MAK, L
THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 427 - 453
[47] SUBLOGARITHMIC-SPACE TURING-MACHINES, NONUNIFORM SPACE COMPLEXITY, AND CLOSURE-PROPERTIES
IBARRA, OH
RAVIKUMAR, B
MATHEMATICAL SYSTEMS THEORY, 1988, 21 (01): : 1 - 17
[48] SOME PROPERTIES OF SPACE-BOUNDED SYNCHRONIZED ALTERNATING TURING-MACHINES WITH UNIVERSAL STATES ONLY
SLOBODOVA, A
THEORETICAL COMPUTER SCIENCE, 1992, 96 (02) : 411 - 419
[49] ARE MULTILAYER FEEDFORWARD NETWORKS EFFECTIVELY TURING-MACHINES
LEVELT, WJM
PSYCHOLOGICAL RESEARCH-PSYCHOLOGISCHE FORSCHUNG, 1990, 52 (2-3): : 153 - 157
[50] SOME PROPERTIES OF SPACE-BOUNDED SYNCHRONIZED ALTERNATING TURING-MACHINES WITH ONLY UNIVERSAL STATES
SLOBODOVA, A
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 102 - 113

← 1 2 3 4 5 →