The Satisfiability Problem for Probabilistic Ordered Branching Programs

@article{Agrawal1997TheSP,
title={The Satisfiability Problem for Probabilistic Ordered Branching Programs},
author={Manindra Agrawal and Thomas Thierauf},
journal={Electronic Colloquium on Computational Complexity (ECCC)},
year={1997},
volume={4}
}

We show that the satisfiability problem for bounded-error probabilistic ordered branching programs is NP-complete. If the error is very small, however (more precisely, if the error is bounded by the reciprocal of the width of the branching program), then we have a polynomial-time algorithm for the satisfiability problem.