Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/sofsem/KwisthoutBG11
%A Kwisthout, Johan
%A Bodlaender, Hans L.
%A van der Gaag, Linda C.
%B SOFSEM
%D 2011
%E Cerná, Ivana
%E Gyimóthy, Tibor
%E Hromkovic, Juraj
%E Jeffery, Keith G.
%E Královic, Rastislav
%E Vukolic, Marko
%E Wolf, Stefan
%I Springer
%K dblp
%P 356-367
%T The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks.
%U http://dblp.uni-trier.de/db/conf/sofsem/sofsem2011.html#KwisthoutBG11
%V 6543
%@ 978-3-642-18380-5
@inproceedings{conf/sofsem/KwisthoutBG11,
added-at = {2019-06-02T00:00:00.000+0200},
author = {Kwisthout, Johan and Bodlaender, Hans L. and van der Gaag, Linda C.},
biburl = {https://www.bibsonomy.org/bibtex/2960eeb034f4b2a3e25e35a14c3998682/dblp},
booktitle = {SOFSEM},
crossref = {conf/sofsem/2011},
editor = {Cerná, Ivana and Gyimóthy, Tibor and Hromkovic, Juraj and Jeffery, Keith G. and Královic, Rastislav and Vukolic, Marko and Wolf, Stefan},
ee = {https://www.wikidata.org/entity/Q59567629},
interhash = {008e5a0caf916b8ec9174b191b68f33e},
intrahash = {960eeb034f4b2a3e25e35a14c3998682},
isbn = {978-3-642-18380-5},
keywords = {dblp},
pages = {356-367},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-06-04T13:33:14.000+0200},
title = {The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks.},
url = {http://dblp.uni-trier.de/db/conf/sofsem/sofsem2011.html#KwisthoutBG11},
volume = 6543,
year = 2011
}