Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Quantum and Stochastic Branching Programs of Bounded Width
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Theory of one-tape linear-time Turing machines
Theoretical Computer Science
On the computational power of probabilistic and quantum branching program
Information and Computation
On the P versus NP intersected with co-NP question in communication complexity
Information Processing Letters
A logical characterisation of linear time on nondeterministic turing machines
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Cryptographic primitives enforcing communication and storage complexity
FC'02 Proceedings of the 6th international conference on Financial cryptography
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Optimal direct sum results for deterministic and randomized decision tree complexity
Information Processing Letters
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
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
A little advice can be very helpful
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
The relationship between inner product and counting cycles
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Classical and quantum partition bound and detector inefficiency
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Communication steps for parallel query processing
Proceedings of the 32nd symposium on Principles of database systems
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)
Arthur-Merlin streaming complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| 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.