On the Complexity of the Compatibility Problem for Succinctly Encoded Conditional Distributions