A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
2003
Journal of computer and system sciences (Print)
It is well known that a nondeterministic Turing machine can be simulated in polynomial time by a so-called guess-and-verify machine. It is an open question whether an analogous simulation exists in the context of space-bounded computation. In this paper, a negative answer to this question is given for ordered binary decision diagrams (OBDDs) and one-way Turing machines. If it is required that all nondeterministic guesses occur at the beginning of the computation, this can blow up the space
doi:10.1016/s0022-0000(03)00037-0
fatcat:vtv33exhxzhvzpei343pruvnue