The Satisfiability Problem for Probabilistic Ordered Branching Programs

Manindra Agrawal. The Satisfiability Problem for Probabilistic Ordered Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 4(60), 1997. [doi]

@article{ECCC-TR97-060,
  title = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
  author = {Manindra Agrawal},
  year = {1997},
  url = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-060/index.html},
  researchr = {https://researchr.org/publication/ECCC-TR97-060},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {4},
  number = {60},
}