Abstract. In this paper, a simple technique which unifies the known approaches for proving lower bound results on the size of deterministic, nondeterministic, and randomized OBDDs and kOBDDs is described. This technique is applied to establish a generic lower bound on the size of randomized OBDDs with bounded error for the so-called "k-stable " functions which have been studied in the literature on read-once branching programs and OBDDs for a long time. It follows by our result that several standard functions are not contained in the analog of the class BPP for OBDDs. It is well-known that k-stable functions are hard for deterministic read-once branching programs. Nevertheless, there is no generic lower bound on the size of randomized read-once branching programs for these functions as for OBDDs. This is proven by presenting a randomized read-once branching program of polynomial size, even with zero error, for a certain k-stable function. As a consequence, we obtain that P $ ZPP " NP " coNP for the analogs of these classes defined in terms of the size of read-once branching programs. 1
|
2315
|
Graph-based algorithms for boolean function manipulation
– Bryant
- 1986
|
|
374
|
Communication Complexity
– Kushilevitz, Nisan
- 1997
|
|
232
|
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
– Bryant
- 1991
|
|
125
|
Unbiased bits from sources of weak randomness and probabilistic communication complexity
– Chor, Goldreich
- 1988
|
|
103
|
Branching programs and binary decision diagrams - theory and applications
– Wegener
- 2000
|
|
93
|
The probabilistic communication complexity of set intersection
– Kalyanasundaram, Schnitger
- 1992
|
|
85
|
Complexity classes in communication complexity theory
– Babai, Frankl, et al.
- 1986
|
|
73
|
Multiparty protocols, pseudorandom generators for logspace, and timespace tradeoffs
– Babai, Nisan, et al.
- 1992
|
|
64
|
On the distributional complexity of disjointness
– Razborov
- 1992
|
|
43
|
On the Complexity of Branching Programs and Decision Trees for Clique Functions
– Wegener
- 1988
|
|
38
|
Communication Complexity and Parallel Computing
– Hromkovič
|
|
37
|
On randomized one-round communication complexity
– Kremer, Nisan, et al.
|
|
27
|
On the size of binary decision diagrams representing boolean functions
– Breitbart, Hunt, et al.
- 1995
|
|
24
|
On the power of randomized branching programs
– Ablayev, Karpinski
- 1996
|
|
21
|
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
– Ablayev
- 1996
|
|
19
|
Lower bounds for depth-restricted branching programs
– Krause
- 1991
|
|
19
|
A linear lower bound on the unbounded error probabilistic communication complexity
– Forster
- 2001
|
|
17
|
Entropy of contact circuits and lower bounds on their complexity
– Jukna
- 1988
|
|
13
|
A lower bound for randomized read-k-times branching programs
– Sauerhoff
- 1997
|
|
12
|
Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines
– Gergov
- 1994
|
|
11
|
Graph driven BDDs—a new data structure for Boolean functions
– SIELING, WEGENER
- 1995
|
|
10
|
Hierarchy theorems for kOBDDs and kIBDDs
– Bollig, Sauerhoff, et al.
- 1998
|
|
10
|
Indexed BDDs: Algorithmic advances in techniques to represent and verify Boolean functions
– Jain, Bitner, et al.
- 1997
|
|
9
|
Randomization and nondeterminism are incomparable for polynomial ordered binary decision diagrams
– Ablayev
- 1996
|
|
9
|
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
– Bollig, Wegener
- 1999
|
|
7
|
On the power of randomized ordered branching programs
– Ablayev, Karpinski
- 1998
|
|
7
|
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
– Duris, Hromkovic, et al.
- 1997
|
|
6
|
bounds on communication complexity
– Lower
- 1987
|
|
6
|
bounds for randomized read-k-times branching programs
– Lower
- 1998
|
|
5
|
The satisfiability problem for probabilistic ordered branching programs
– Agrawal, Thierauf
- 1997
|
|
4
|
bounds on the complexity of 1-time only branching programs
– Lower
- 1984
|
|
4
|
On P versus NP " co-NP for decision trees and read-once branching programs
– Jukna, Razborov, et al.
- 1997
|
|
3
|
Exponential lower bounds on the complexity of local and real-time branching programs
– Krause
- 1988
|
|
3
|
A lower bound for integer multiplication on randomized ordered read-once branching programs
– Ablayev, Karpinski
- 1999
|
|
3
|
Lower bounds on the complexity of 1-time only branching programs
– Dunne
- 1985
|
|
3
|
bounds on communication complexity
– Jukna, Lower
- 1987
|
|
1
|
Communication complexity and lower bounds on multilective computations
– Hromkovic
- 1998
|
|
1
|
A note on Las Vegas OBDDs
– Karpinski, Mubarakzjanov
- 1998
|
|
1
|
Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations
– s, c, et al.
- 1997
|
|
1
|
OBDDs and Read-Once BPs for k-Stable Functions 23
– Rand
- 1994
|
|
1
|
c & G. Schnitger (2001). On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
– Hromkovi
|
|
1
|
Savick y
– Jukna, Razborov, et al.
- 1999
|
|
1
|
CommunicationComplexity and Parallel Computing
– Hromkovic
- 1997
|
|
