Learning structure

[mark]

Just to clarify, are you asking for the actual running time or the computational complexity?

[borisrabin]

Just to clarify, are you asking for the actual running time or the computational complexity?

I am asking about the computational complexity (time complexity).

Thanks,
Boris

[mark]

I don't know the time complexity. An exhaustive search is superexponential in the number of variables, and a GreedyThickThinning search may still be bad in the worst case, but in practice it's pretty quick. If you put a limit on the maximum number of parents, it's even better.