AN OPTIMAL LOWER BOUND FOR TURING-MACHINES WITH ONE WORK TAPE AND A 2-WAY INPUT TAPE

被引：0

作者：

MAASS, W ^{[1
]}

SCHNITGER, G ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 223卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：249 / 264

页数：16

共 50 条

[1] SPEED-UP OF TURING-MACHINES WITH ONE WORK TAPE AND A 2-WAY INPUT TAPE
MAASS, W
SCHORR, A
SIAM JOURNAL ON COMPUTING, 1987, 16 (01) : 195 - 202
[2] A SPACE BOUND FOR ONE-TAPE MULTIDIMENSIONAL TURING-MACHINES
LOUI, MC
THEORETICAL COMPUTER SCIENCE, 1981, 15 (03) : 311 - 320
[3] 2-WAY FINITE PROBABILISTIC-AUTOMATA AND TAPE-BOUNDED TURING-MACHINES
FREIVALD, RV
DOKLADY AKADEMII NAUK SSSR, 1981, 256 (06): : 1326 - 1329
[4] OPTIMAL-ALGORITHMS FOR SORTING ON SINGLE TAPE TURING-MACHINES
WIEDERMANN, J
IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 306 - 314
[5] THE COMPLEXITY OF MATRIX TRANSPOSITION ON ONE-TAPE OFF-LINE TURING-MACHINES WITH OUTPUT TAPE
DIETZFELBINGER, M
MAASS, W
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 188 - 200
[6] THE COMPLEXITY OF MATRIX TRANSPOSITION ON ONE-TAPE OFF-LINE TURING-MACHINES WITH OUTPUT TAPE
DIETZFELBINGER, M
MAASS, W
THEORETICAL COMPUTER SCIENCE, 1993, 108 (02) : 271 - 290
[7] THE SPEED OF COPYING ON ONE-TAPE OFF-LINE TURING-MACHINES
DIETZFELBINGER, M
INFORMATION PROCESSING LETTERS, 1989, 33 (02) : 83 - 89
[8] TAPE-COMPLEXITY OF NON-DETERMINED TURING-MACHINES
ALBERTS, MY
IZVESTIYA VYSSHIKH UCHEBNYKH ZAVEDENII MATEMATIKA, 1985, (07): : 81 - 83
[9] 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
[10] SOME TIME-SPACE BOUNDS FOR ONE-TAPE DETERMINISTIC TURING-MACHINES
LISKIEWICZ, M
LORYS, K
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 380 : 297 - 307

← 1 2 3 4 5 →