Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Entropy of contact circuits and lower bounds on their complexity
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Lower bounds for depth-restricted branching programs
Information and Computation
Private vs. common random bits in communication complexity
Information Processing Letters
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
On randomized one-round communication complexity
Computational Complexity
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
On the size of randomized OBDDs and read-once branching programs for k-stable functions
Computational Complexity
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Power of Polynomial Size Omega-Branching Programs
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Classes with Complete Problems Between P and NP-C
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Lower Bounds for Computation with Limited Nondeterminism
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Computations with a restricted number of nondeterministic steps (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Computations with a restricted number of nondeterministic steps.
Computations with a restricted number of nondeterministic steps.
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
| Hi-index | 0.01 |
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 complexity exponentially in the input length for these models. This is a consequence of the following main result of the paper. There is a sequence of boolean functions fn : {0, 1}n → {0, 1} such that fn has nondeterministic OBDDs of polynomial size that use at most (1/3). (n/3)1/3 log n.(1 + o(1)) nondeterministic guesses for each computation, but fn already requires exponential size if only at most (1 - ε). (1/3).(n/3)1/3 log n nondeterministic guesses may be used, where ε0 is an arbitrarily small constant.