@inproceedings{4dddb3c9a0e64494b059938b003e0351,
title = "The complexity of plate probabilistic models",
abstract = "{\textcopyright} Springer International Publishing Switzerland 2015. Plate-based probabilistic models combine a few relational constructs with Bayesian networks, so as to allow one to specify large and repetitive probabilistic networks in a compact and intuitive manner. In this paper we investigate the combined, data and domain complexity of plate models, showing that they range from polynomial to #P-complete to #EXP-complete.",
author = "Cozman, {Fabio G.} and Mau{\'a}, {Denis D.}",
year = "2015",
month = jan,
day = "1",
doi = "10.1007/978-3-319-23540-0_3",
language = "American English",
isbn = "9783319235394",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "36--49",
booktitle = "The complexity of plate probabilistic models",
note = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Conference date: 01-01-2018",
}