Computations with a restricted number of nondeterministic steps (Extended Abstract)

Authors:
Chandra M. R. Kintala;Patrick C. Fischer
Affiliations:
-;-
Venue:
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Year:
1977

Citing 3
Cited 6

Real-Time Definable Languages

Journal of the ACM (JACM)
Degree-languages, polynomial time recognition, and the LBA problem

STOC '75 Proceedings of seventh 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

Measures of nondeterminism for pushdown automata

Journal of Computer and System Sciences
Refining Nondeterminism in Relativizations of Complexity Classes

Journal of the ACM (JACM)
Some properties of recognizable L-subsets

Theoretical Computer Science
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines

Journal of Computer and System Sciences
Measuring nondeterminism in pushdown automata

Journal of Computer and System Sciences
Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nondeterminism is one of the most elusive concepts in computing. In this paper we direct our efforts towards viewing nondeterminism as an additional resource at the disposal of time or space bounded Turing machine computations and study the classes of languages acceptable by these machines with restricted amounts of nondeterminism. One motivation for this study comes from the observation that for many of the well-known NP-complete problems, if n' is the length of the input, an algorithm exists requiring a total number of moves which is polynomial in n, but the number of nondeterministic moves is only linear in n.