the final paper (ie big picture description without causal discovery jargon, intuitive sepset (in)consistency examples, 3

We would like to thank the reviewers for their insightful comments and suggestions. Reply to Reviewer 1 ( "discuss computational complexity"): The reviewer is right in pointing out that the complexity for ensuring sepset consistency needs to be clarified. PC algorithm runs in exponential time in the worst case but usually in polynomial time on sparse DAGs]. The new complexity is thus at worst linear in all cases. Reply to Reviewer 2 ( "provide additional experimental evaluation on standard benchmarks"): Bayesian Network repository, which display a clearer performance improvement over standard PC, see Figure below.