On the size of randomized OBDDs and read-once branching programs for k-stable functions

  • Authors:

  • Martin Sauerhoff

  • Affiliations:

  • FB Informatik, LS 2, Univ. Dortmund, Dortmund, Germany

  • Venue:
  • STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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.