Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COCO
1998
Springer

favoriteEmaildiscussreport

86views Algorithms» more COCO 1998»

The Satisfiability Problem for Probabilistic Ordered Branching Programs

13 years 9 months ago

The Satisfiability Problem for Probabilistic Ordered Branching Programs

Download www.cse.iitk.ac.in

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.

Manindra Agrawal, Thomas Thierauf

Real-time Traffic

Algorithms | Branching Program | COCO 1998 | Probabilistic Ordered Branching | Satisfiability Problem |

claim paper

Related Content

» Partial Order Reduction for Probabilistic Branching Time

» A new Approach for Solving Satisfiability Problems with Qualitative Preferences

» MaxSolver An efficient exact algorithm for weighted maximum satisfiability

» Activeconstraint variable ordering for faster feasibility of mixed integer linear programs

» The Coin Problem and Pseudorandomness for Branching Programs

» A Probabilistic Algorithm for kSAT and Constraint Satisfaction Problems

» Stochastic Satisfiability Modulo Theories for Nonlinear Arithmetic

» A SliceBased Decision Procedure for TypeBased Partial Orders

» Branch History Matching Branch Predictor Warmup for Sampled Simulation

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	COCO
Authors	Manindra Agrawal, Thomas Thierauf

Comments (0)