scientific article; zbMATH DE number 2068877
From MaRDI portal
Publication:4465338
zbMATH Open1095.68594MaRDI QIDQ4465338FDOQ4465338
Authors: Martin Kutrib 
Publication date: 27 May 2004
Title of this publication is not available (Why is that?)
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (20)
- Sharply bounded alternation and quasilinear time
- Deterministic Turing machines in the range between real-time and linear-time.
- Improving the efficiency of non-deterministic computations
- Regulated nondeterminism in pushdown automata
- Context-dependent nondeterminism for pushdown automata
- Two Tapes are Better than One for Nondeterministic Machines
- Determinism versus nondeterminism for linear time RAMs with memory restrictions
- Title not available (Why is that?)
- On multi-head automata with restricted nondeterminism
- Regulated Nondeterminism in Pushdown Automata
- Computational power of one-way Turing machines with sublogarithmic memory restrictions
- Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems
- A note on deterministic and nondeterministic time complexity
- Dimension- and time-hierarchies for small time bounds.
- Uniform simulations of nondeterministic real time multitape turing machines
- Nonerasing, counting, and majority over the linear time hierarchy
- Almost-everywhere complexity hierarchies for nondeterministic time
- On the structure of one-tape nondeterministic Turing machine time hierarchy
- Title not available (Why is that?)
- Infinite Computations and a Hierarchy in 3 Reconsidered
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4465338)
