On the Complexity of the Compatibility Problem for Succinctly Encoded Conditional Distributions
This paper formalise and study a succinct version of the compatibility problem, encoding conditional distributions as arithmetic circuits, and shows that, for succinct circuit representations of conditionals, the compatibility problem is intractable.
Guy Edward Toh Emerson
· 0 citations