Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable

Rustam Mubarakzjanov. Bounded-Width Probabilistic OBDDs and Read-Once Branching Programs are Incomparable. Electronic Colloquium on Computational Complexity (ECCC), 8(37), 2001. [doi]

Abstract

Abstract is missing.