scientific article; zbMATH DE number 3319549
From MaRDI portal
Publication:5599173
Cited in
(14)- On the bit complexity of distributed computations in a ring with a leader
- An NP-complete language accepted in linear time by a one-tape Turing machine
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time
- The halting problem for linear Turing assemblers
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- For completeness, sublogarithmic space is no space.
- Deterministic Turing machines in the range between real-time and linear-time.
- Affine mappings defined by finite transducers
- Converting nondeterministic two-way automata into small deterministic linear-time machines
- A hierarchy of fast reversible Turing machines
- Verifying time complexity of Turing machines
- From Logic to Theoretical Computer Science – An Update
- Weight-reducing Turing machines
- Nondeterminism and the clique problem
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 Q5599173)
