Time complexity of AC-3
	n CSP has n2 directed arcs n Each 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 n Checking an arc requires at most d2 time n O(n2 * d * d2) = O(n2d3)