Learning Sparse Causal Models is not NP-hard

Tom Claassen, Joris Mooij, Tom Heskes

This paper shows that causal model discovery is not an NP-hard problem, in the sense that for sparse graphs bounded by node degree k the sound and complete causal model can be obta…