Discrete probabilistic program inference is fixed-parameter tractable under bounded treewidth of primal graphs and exponentially bounded inverse acceptance probability.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it