Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines

Shigeki Iwata, Takumi Kasai, Etsuro Moriya

Research output: Contribution to journalArticle

Abstract

Ruzzo [Tree-size bounded alternation, J. Comput. Syst. Sci. 21] introduced the notion of tree-size for alternating Turing machines (ATMs) and showed that it is a reasonable measure for classification of complexity classes. We establish in this paper that computations by tree-size and space simultaneously bounded ATMs roughly correspond to computations by time and space simultaneously bounded nondeterministic TMs (NTMs). We also show that not every polynomial time bounded and sublinear space simultaneously bounded NTM can be simulated by any deterministic TM with a slightly increased time bound and a slightly decreased space bound simultaneously.

Original languageEnglish
Pages (from-to)267-278
Number of pages12
JournalActa Informatica
Volume30
Issue number3
DOIs
Publication statusPublished - 1993 Mar
Externally publishedYes

Fingerprint

Turing machines
Polynomials

ASJC Scopus subject areas

  • Information Systems

Cite this

Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines. / Iwata, Shigeki; Kasai, Takumi; Moriya, Etsuro.

In: Acta Informatica, Vol. 30, No. 3, 03.1993, p. 267-278.

Research output: Contribution to journalArticle

Iwata, Shigeki ; Kasai, Takumi ; Moriya, Etsuro. / Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines. In: Acta Informatica. 1993 ; Vol. 30, No. 3. pp. 267-278.
@article{6f3b2065805748d8a9808f7ff3044a19,
title = "Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines",
abstract = "Ruzzo [Tree-size bounded alternation, J. Comput. Syst. Sci. 21] introduced the notion of tree-size for alternating Turing machines (ATMs) and showed that it is a reasonable measure for classification of complexity classes. We establish in this paper that computations by tree-size and space simultaneously bounded ATMs roughly correspond to computations by time and space simultaneously bounded nondeterministic TMs (NTMs). We also show that not every polynomial time bounded and sublinear space simultaneously bounded NTM can be simulated by any deterministic TM with a slightly increased time bound and a slightly decreased space bound simultaneously.",
author = "Shigeki Iwata and Takumi Kasai and Etsuro Moriya",
year = "1993",
month = "3",
doi = "10.1007/BF01179374",
language = "English",
volume = "30",
pages = "267--278",
journal = "Acta Informatica",
issn = "0001-5903",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines

AU - Iwata, Shigeki

AU - Kasai, Takumi

AU - Moriya, Etsuro

PY - 1993/3

Y1 - 1993/3

N2 - Ruzzo [Tree-size bounded alternation, J. Comput. Syst. Sci. 21] introduced the notion of tree-size for alternating Turing machines (ATMs) and showed that it is a reasonable measure for classification of complexity classes. We establish in this paper that computations by tree-size and space simultaneously bounded ATMs roughly correspond to computations by time and space simultaneously bounded nondeterministic TMs (NTMs). We also show that not every polynomial time bounded and sublinear space simultaneously bounded NTM can be simulated by any deterministic TM with a slightly increased time bound and a slightly decreased space bound simultaneously.

AB - Ruzzo [Tree-size bounded alternation, J. Comput. Syst. Sci. 21] introduced the notion of tree-size for alternating Turing machines (ATMs) and showed that it is a reasonable measure for classification of complexity classes. We establish in this paper that computations by tree-size and space simultaneously bounded ATMs roughly correspond to computations by time and space simultaneously bounded nondeterministic TMs (NTMs). We also show that not every polynomial time bounded and sublinear space simultaneously bounded NTM can be simulated by any deterministic TM with a slightly increased time bound and a slightly decreased space bound simultaneously.

UR - http://www.scopus.com/inward/record.url?scp=34250073261&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250073261&partnerID=8YFLogxK

U2 - 10.1007/BF01179374

DO - 10.1007/BF01179374

M3 - Article

AN - SCOPUS:34250073261

VL - 30

SP - 267

EP - 278

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

IS - 3

ER -