# What is the time complexity of FC_MRV algorithm?

I am studying CSP and read the papers on it.I wanted to know the time complexity of Forward checking with Minium Remaining Value algorithm.

• What did Russell and Norvig say about it? – Juho May 13 '19 at 19:59
• He gives me example but I don't find the time complexity.Time Complexity of BT algorithm is O(d^n). – Acc May 14 '19 at 4:22

The worst case complexity of FC-MRV is $$O(n^2 d^2)$$ where $$n$$ is the number of variables and $$d$$ is the number of domain size.