Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
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 randomized one-round communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication 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
On the Size of Ordered Binary Decision Diagrams Representing Threshold Functions
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Lower Bounds for Deterministic and Nondeterministic Branching Programs
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A Lower Bound Technique for Restricted Branching Programs and Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
It is well-known that an arbitrary nondeterministic Turing machine can be simulated with polynomial overhead 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 nondeterministic OBDDs. If we require that all nondeterministic variables are tested at the top of the OBDD, i. e., at the beginning of the computation, this may blowup the size exponentially. 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 with O(n1/3 log n) nondeterministic variables, but fn requires exponential size if only at most O(log n) nondeterministic variables may be used.