• Sorted by Date • Classified by Publication Type • Sorted by First Author Last Name • Classified by Author Last Name •
Alan K. Mackworth and E. C. Freuder. The Complexity of Constraint Satisfaction Revisited. Artificial Intelligence, 59:57–62, 1993.
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.
@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 ={},
}
Generated by bib2html.pl (written by Patrick Riley ) on Wed Apr 23, 2014 19:08:34