17 Feb 2005
CS 3243 - Constraint Satisfaction
38
Time complexity of AC-3
nCSP has n2 directed
arcs nEach arc Xi,Xj has d
possible values.
For each value we
can reinsert the
neighboring arc
Xk,Xi at most d times because Xi has d values
arcs nEach arc Xi,Xj has d
possible values.
For each value we
can reinsert the
neighboring arc
Xk,Xi at most d times because Xi has d values
nChecking an arc requires
at most d2 time
nO(n2 * d * d2) = O(n2d3)
