+1 vote
886 views
in Artificial Intelligence by

1 Answer

0 votes
by
selected by (user.guest)
 
Best answer

The worst-case complexity of running the AC-3 algorithm on a tree-structured constraint satisfaction problem is image. On a tree-structured graph there is no arc that will be considered more than once.

The worst-case complexity of AC-3 algorithm is image

Here, E is the number of edges and D is the size of the largest domain.


Related questions

+1 vote
1 answer 420 views
+2 votes
2 answers 343 views
0 votes
0 answers 297 views
+1 vote
1 answer 88 views
0 votes
1 answer 62 views
0 votes
1 answer 3.7k views
+1 vote
1 answer 94 views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...