The complexity of constraint satisfaction revisited

Alan K. Mackworth; Eugene C. Freuder

doi:10.1016/0004-3702(93)90170-G

The complexity of constraint satisfaction revisited

Alan K. Mackworth
, Eugene C. Freuder

School of Computer Science and Information Technology

University of British Columbia
University of New Hampshire

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	57-62
Number of pages	6
Journal	Artificial Intelligence
Volume	59
Issue number	1-2
DOIs	https://doi.org/10.1016/0004-3702(93)90170-G
Publication status	Published - Feb 1993

Access to Document

10.1016/0004-3702(93)90170-G

Cite this

@article{54d302f1cd554f4e8beefda22cecda4c,

title = "The complexity of constraint satisfaction revisited",

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.",

author = "Mackworth, \{Alan K.\} and Freuder, \{Eugene C.\}",

year = "1993",

month = feb,

doi = "10.1016/0004-3702(93)90170-G",

language = "English",

volume = "59",

pages = "57--62",

journal = "Artificial Intelligence",

issn = "0004-3702",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - The complexity of constraint satisfaction revisited

AU - Mackworth, Alan K.

AU - Freuder, Eugene C.

PY - 1993/2

Y1 - 1993/2

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0037554057

U2 - 10.1016/0004-3702(93)90170-G

DO - 10.1016/0004-3702(93)90170-G

M3 - Article

AN - SCOPUS:0037554057

SN - 0004-3702

VL - 59

SP - 57

EP - 62

JO - Artificial Intelligence

JF - Artificial Intelligence

IS - 1-2

ER -

The complexity of constraint satisfaction revisited

Abstract

Access to Document

Other files and links

Fingerprint

Cite this