A hierarchy for nondeterministic time complexity

Authors:
Stephen A. Cook
Affiliations:
-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 2
Cited 11

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities

Journal of the ACM (JACM)

K-sat on groups and undecidability

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Satisfiability Is Quasilinear Complete in NQL

Journal of the ACM (JACM)
Observations on nondeterministic multidimensional iterative arrays

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Hierarchies for semantic classes

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIGACT news complexity theory column 52

ACM SIGACT News
Applying practice to theory

ACM SIGACT News
Unconditional Lower Bounds against Advice

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On two-way multihead automata

Journal of Computer and System Sciences
On the extension of Gladkij's Theorem and the Hierarchies of languages

Journal of Computer and System Sciences
Robust simulations and significant separations

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this paper is to prove the following result: Theorem 1 For any real numbers r1, r2, 1 ≤ r1 2, there is a set A of strings which has nondeterministic time complexity nr2 but not nondeterministic time complexity nr1 The computing devices are non-deterministic multitape Turing machines.