Modal Satisfiability Is in Deterministic Linear Space
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Local Problems, Planar Local Problems and Linear Time
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
A logical characterisation of linear time on nondeterministic turing machines
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Improved simulation of nondeterministic turing machines
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Observations on complete sets between linear time and polynomial time
Information and Computation
Improved simulation of nondeterministic Turing machines
Theoretical Computer Science
Shrinking multi-pushdown automata
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bounds for RAMs and quantifier elimination
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |
We show that, for multi-tape Turing machines, non-deterministic linear time is more powerful than deterministic linear time. We also discuss the prospects for extending this result to more general Turing machines.