scientific article; zbMATH DE number 2068877
From MaRDI portal
Publication:4465338
Recommendations
Cited in
(20)- On the structure of one-tape nondeterministic Turing machine time hierarchy
- Almost-everywhere complexity hierarchies for nondeterministic time
- Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems
- Sharply bounded alternation and quasilinear time
- Deterministic Turing machines in the range between real-time and linear-time.
- Nonerasing, counting, and majority over the linear time hierarchy
- Determinism versus nondeterminism for linear time RAMs with memory restrictions
- Computational power of one-way Turing machines with sublogarithmic memory restrictions
- Improving the efficiency of non-deterministic computations
- A note on deterministic and nondeterministic time complexity
- Two Tapes are Better than One for Nondeterministic Machines
- scientific article; zbMATH DE number 4145886 (Why is no real title available?)
- Regulated Nondeterminism in Pushdown Automata
- Infinite Computations and a Hierarchy in 3 Reconsidered
- scientific article; zbMATH DE number 3980489 (Why is no real title available?)
- Uniform simulations of nondeterministic real time multitape turing machines
- On multi-head automata with restricted nondeterminism
- Dimension- and time-hierarchies for small time bounds.
- Regulated nondeterminism in pushdown automata
- Context-dependent nondeterminism for pushdown automata
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)
