Boolean Decomposition Schemes and the Complexity of Reliability Computations

J. Scott Provan. Boolean Decomposition Schemes and the Complexity of Reliability Computations. In Fred Roberts, Frank Hwang, Clyde Monma, editors, Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989. Volume 5 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 213-228, DIMACS/AMS, 1989.

@inproceedings{Provan89-0,
  title = {Boolean Decomposition Schemes and the Complexity of Reliability Computations},
  author = {J. Scott Provan},
  year = {1989},
  researchr = {https://researchr.org/publication/Provan89-0},
  cites = {0},
  citedby = {0},
  pages = {213-228},
  booktitle = {Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989},
  editor = {Fred Roberts and Frank Hwang and Clyde Monma},
  volume = {5},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}