Technical Reports

The ICICS/CS Reading Room


UBC CS TR-92-26 Summary

The Complexity of Constraint Satisfaction Revisited, September 1992 Alan K. Mackworth and Eugene C. Freuder, 5 pages

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.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.