Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
Turing machines and the spectra of first-order formulas with equality
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Refinements of the nondeterministic time and space hierarchies
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Translational methods and computational complexity
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
A generator of context-sensitive languages
Journal of Computer and System Sciences
A hierarchy for nondeterministic time complexity
Journal of Computer and System Sciences
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Time- and tape-bounded turing acceptors and AFLs
Journal of Computer and System Sciences
Tape-bounded turing acceptors and principal AFLs
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Storage requirements for deterministic polynomialtime recognizable languages
Journal of Computer and System Sciences
Algorithms and theory of computation handbook
Complexity of the cop and robber guarding game
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
The guarding game is E-complete
Theoretical Computer Science
| Hi-index | 0.00 |
Complexity classes defined by time-bounded and space-bounded Turing acceptors are studied in order to learn more about the cost of deterministic simulation of nondeterministic processes and about time-space tradeoffs. Here complexity classes are compared by means of reducibilities and class-complete sets. The classes studied are defined by bounds of the order n, n^k, 2^n, 2^n^^^k. The results do not establish the existence of possible relationships between these classes; rather, they show the consequences of such relationships, in some cases offering circumstantial evidence that these relationships, do not hold and that certain pairs of classes are set-theoretically incomparable.