Discrete probabilistic program inference is fixed-parameter tractable under bounded treewidth of primal graphs and exponentially bounded inverse acceptance probability.
Rewriting in free hypergraph categories.arXiv preprint arXiv:1712.09495
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation
Discrete probabilistic program inference is fixed-parameter tractable under bounded treewidth of primal graphs and exponentially bounded inverse acceptance probability.