@COMMENT This file was generated by bib2html.pl version 0.94
@COMMENT written by Patrick Riley
@COMMENT This file came from Alan K. Mackworth's publication pages at
@COMMENT http://www.cs.ubc.ca/~mack/publications
@Article{AI93,
author = {Alan K. Mackworth and E. C. Freuder},
title = {The Complexity of Constraint Satisfaction Revisited},
year = {1993},
journal = {Artificial Intelligence},
volume = {59},
pages = {57--62},
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.},
bib2html_pubtype ={Refereed Journal},
bib2html_rescat ={},
}