Restricted branching programs are considered by the investigation of relationships between complexity classes of Boolean functions. Read-once ordered branching programs (or OBDDs) form the most restricted class of this computation model. Since the problem of proving exponential lower bounds on the complexity for general probabilistic OBDDs is open so far, ... more >>>

We extend Lutz's measure to probabilistic classes, and obtain notions of measure on probabilistic complexity classes C such as BPP , BPE and BPEXP. Unlike former attempts, all our measure notions satisfy all three Lutz's measure axioms, that is every singleton {L} has measure zero in C, the whole space ... more >>>