The complexity of constraint satisfaction revisited
Alan K. Mackworth, Eugene C. Freuder · The MIT Press eBooks · 1994
Mackworth, A.K. and E.C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence 59 (1993) 57-62. This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity of some polynomial network consistency algorithms for constraint satisfaction problems.