Relations Between Time and Tape Complexities
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Two tapes are better than one for nondeterministic machines
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Proof of a conjecture of R. Kannan
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A time lower bound for satisfiability
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
Improved simulation of nondeterministic turing machines
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Improved simulation of nondeterministic Turing machines
Theoretical Computer Science
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
While nondeterminism is widely beleived to be more powerful than determinism in various contexts (the most famous being the conjecture that NP strictly contains P), no proof of the added power of nondeterminism is available for any significant issue. The weaker conjecture (than NP strictly contains P) that there is a language accepted by a nondeterministic linear time bounded multitape Turing Machine that cannot be accepted by a deterministic linear time bounded multi-tape TM still seems quite hard (Paul 1982). The aim of this paper is to show how the existance of the polynomial-time hierarchy of Meyer and Stockmeyer(1972) and the related concept of alternation (Chandra, Kozen and Stockmeyer(1981)) can be exploited to prove the power of nondeterminism over determinism in some contexts. It is hoped that this approach may be useful in proving stronger results.