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.

  • $\begingroup$ What did Russell and Norvig say about it? $\endgroup$ – Juho May 13 '19 at 19:59
  • $\begingroup$ He gives me example but I don't find the time complexity.Time Complexity of BT algorithm is O(d^n). $\endgroup$ – 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.

| cite | improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.