• DOI:10.1007/978-3-642-03351-3_31
Corpus ID: 2832656

On Models of a Nondeterministic Computation

@inproceedings{Vyalyi2009OnMO,
  title={On Models of a Nondeterministic Computation},
  author={M. Vyalyi},
  booktitle={CSR},
  year={2009}
}

M. Vyalyi

Published in CSR 2009

Mathematics, Computer Science

In this paper we consider a nondeterministic computation performed by deterministic multi-head 2-way automata with a read-only access to an auxiliary memory. The memory contains additional data (a guess) and the computation is successful iff it is successful for some memory content. Also we consider the case of restricted guesses in which a guess should satisfy some constraint. We show that the standard complexity classes such as L, NL, P, NP, PSPACE can be characterized in terms of these… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed