On input read-modes of alternating Turing machines
type: Item
instance of: scholarly article
title: On input read-modes of alternating Turing machines
zbMATH Open document ID: 0873.68055
DOI: 10.1016/0304-3975(94)00253-F
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 984954
zbMATH Keywords: Turing machine
author: Liming Cai
author: Jianer Chen
MaRDI profile type: Publication
cites work: Q4281539
cites work: On uniformity within \(NC^ 1\)
cites work: Q4385519
cites work: Q3140633
cites work: An Optimal Parallel Algorithm for Formula Evaluation
cites work: Alternation
cites work: Characterizing parallel hierarchies by reducibilities
cites work: A taxonomy of problems with fast parallel algorithms
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Logical definability of NP optimization problems
cites work: Quantifiers and approximation
cites work: Optimization, approximation, and complexity classes
cites work: Q3694703
cites work: On uniform circuit complexity
Recommended article: ALTERNATING TURING MACHINES WITH MODIFIED ACCEPTING STRUCTURE
Recommended article: On reversal bounded alternating Turing machines
Recommended article: A note on alternating on-line Turing machines
Recommended article: Q2766856
Recommended article: Alternating Turing machines for inductive languages
Recommended article: Q3783614
Recommended article: Q3219117
Recommended article: Reversal Complexity Classes for Alternating Turing Machines
Recommended article: On the power of alternation on reversal-bounded alternating Turing machines with a restriction
Recommended article: On the Way to Alternating Weak Automata
description: scientific article; zbMATH DE number 984954