The Satisfiability Problem for Probabilistic Ordered Branching Programs

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.

• Type: Conference
• Year: 1998
• Where: COCO
• Authors: Manindra Agrawal, Thomas Thierauf
• Keywords: Algorithms, Branching Program, COCO 1998, Probabilistic Ordered Branching, Satisfiability Problem