 
Summary: The Satisfiability Problem for
Probabilistic Ordered Branching Programs
Manindra Agrawal
Dept. of Computer Science
Indian Institute of Technology
Kanpur 208016, India
Thomas Thierauf
Abt. Theoretische Informatik
Universitšat Ulm
89069 Ulm, Germany
Abstract
We show that the satisfiability problem for boundederror proba
bilistic ordered branching programs is NPcomplete. 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
polynomialtime algorithm for the satisfiability problem.
1 Introduction
Branching programs are an interesting computational model to investigate.
One reason for this is the tight relationship of the size of a branching program
to the space needed by (nonuniform) Turing machines [Mas76] (see [BS90]).
