Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PROBABILISTIC BRANCHING PROGRAMS:
Reports tagged with Probabilistic branching programs:
TR00-085 | 19th September 2000
Rustam Mubarakzjanov

Probabilistic OBDDs: on Bound of Width versus Bound of Error

Ordered binary decision diagrams (OBDDs) are well established tools to
represent Boolean functions. There are a lot of results concerning
different types of generalizations of OBDDs. The same time, the power
of the most general form of OBDD, namely probabilistic (without bounded
error) OBDDs, is not studied enough. In ... more >>>




ISSN 1433-8092 | Imprint