On input read-modes of alternating Turing machines
From MaRDI portal
Recommendations
- ALTERNATING TURING MACHINES WITH MODIFIED ACCEPTING STRUCTURE
- On reversal bounded alternating Turing machines
- A note on alternating on-line Turing machines
- scientific article; zbMATH DE number 1696661
- Alternating Turing machines for inductive languages
- scientific article; zbMATH DE number 4047169
- scientific article; zbMATH DE number 3885317
- Reversal Complexity Classes for Alternating Turing Machines
- On the power of alternation on reversal-bounded alternating Turing machines with a restriction
- On the Way to Alternating Weak Automata
Cites work
- scientific article; zbMATH DE number 440476 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 512844 (Why is no real title available?)
- scientific article; zbMATH DE number 1142303 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Alternation
- An Optimal Parallel Algorithm for Formula Evaluation
- Characterizing parallel hierarchies by reducibilities
- Logical definability of NP optimization problems
- On uniform circuit complexity
- On uniformity within \(NC^ 1\)
- Optimization, approximation, and complexity classes
- Parity, circuits, and the polynomial-time hierarchy
- Quantifiers and approximation
Cited in
(5)
This page was built for publication: On input read-modes of alternating Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672377)
