M. Agrawal, T. Thierauf, "The Satisfiability Problem for Probabilistic Ordered Branching Programs," Computational Complexity, Annual IEEE Conference on, pp. 81, 13th Annual IEEE Conference on Computational Complexity (CoCo'98), 1998.

@article{ 10.1109/CCC.1998.694593,
author = {M. Agrawal and T. Thierauf},
title = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {1998},
issn = {1093-0159},
pages = {81},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.1998.694593},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}

TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - The Satisfiability Problem for Probabilistic Ordered Branching Programs
SN - 1093-0159
SP
EP
A1 - M. Agrawal,
A1 - T. Thierauf,
PY - 1998
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -