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.

We study the problem of computing the reliability of a network operated using the OSPF protocol where links fail with given independent probabilities. Our measure of reliability is the expected lost demand in the network. Computing this measure is #P-complete, so we developed approximation methods based on related work for circuit-switched networks. Preliminary results show the robustness of op...

Many hard problems can be solved efficiently for problem instances that can be decomposed by tree decompositions of small width. In particular for problems beyond NP, such as #P-complete counting problems, tree decomposition-based methods are particularly attractive. However, finding an optimal tree decomposition is itself an NP-hard problem. Existing methods for finding tree decompositions of ...

Voting and assignment are two of the most fundamental settings in social choice theory. For both settings, random serial dictatorship (RSD) is a well-known rule that satisfies anonymity, ex post efficiency, and strategyproofness. Recently, it was shown that computing the resulting probabilities is #P-complete both in the voting and assignment setting. In this paper, we present efficient paramet...

background: complete colonic duplication is a very rare congenital anomaly that may have different presentations according to its location and size. complete colonic duplication can occur in 15% of gastrointestinal duplication. we report two cases of complete colonic duplications, and their characteristics. case presentation: we present two patients with complete colonic duplication with differ...

Implications of a formal context obey Armstrong rules, which allows one to define a minimal (in the number of implications) implication basis, called Duquenne–Guigues basis or stem base in the literature. In this paper we show how implications are reduced to functional dependencies and prove that the problem of determining the size of the stem base is a #P-complete problem. © 2007 Published by ...