Johan Kwisthout. The Computational Complexity of Monotonicity in Probabilistic Networks. In Erzsébet Csuhaj-Varjú, Zoltán Ésik, editors, Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings. Volume 4639 of Lecture Notes in Computer Science, pages 388-399, Springer, 2007. [doi]
@inproceedings{Kwisthout07,
title = {The Computational Complexity of Monotonicity in Probabilistic Networks},
author = {Johan Kwisthout},
year = {2007},
doi = {10.1007/978-3-540-74240-1_34},
url = {http://dx.doi.org/10.1007/978-3-540-74240-1_34},
researchr = {https://researchr.org/publication/Kwisthout07},
cites = {0},
citedby = {0},
pages = {388-399},
booktitle = {Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
editor = {Erzsébet Csuhaj-Varjú and Zoltán Ésik},
volume = {4639},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-74239-5},
}