Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
Probabilistic simulations (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Alternation and the power of nondeterminism
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Holographic Proofs and Derandomization
SIAM Journal on Computing
A TcS2 = 0 (2n) time/space tradeoff for certain NP-complete problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Towards separating nondeterministic time from deterministic time
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
3-coloring in time O (1.3289n)
Journal of Algorithms
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Hi-index | 0.00 |
The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large bounded-degree graph whose size is exponential in the running time of the NTM. The graph is the natural one defined by the configurations of the NTM. All methods in the literature have required time linear in the size S of this graph. This paper presents a new simulation method that runs in time Õ(√S). The search savings exploit the one-dimensional nature of Turing machine tapes. In addition, we remove most of the time-dependence on nondeterministic choice of states and tape head movements.