The Complexity of Constraint Satisfaction Revisited

ID
TR-92-26
Authors
Alan K. Mackworth and Eugene C. Freuder
Publishing date
September 1992
Length
5 pages
Abstract
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.
File(s)
TR-92-26.pdf