+1 vote
438 views
in Artificial Intelligence by

1 Answer

+1 vote
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

Welcome to CPEN Talk
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...