COCO
1998
Springer
14 years 10 months ago
1998
Springer
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 erro...
TCC
2007
Springer
15 years 16 days ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...