Date: 2006-09-13 04:55:34

Applied mathematics

Local consistency

Constraint satisfaction problem

Constraint satisfaction

NP-complete

Computational complexity theory

NP

P versus NP problem

Complexity of constraint satisfaction

Theoretical computer science

Constraint programming

Complexity classes

The Complexity of Reasoning with Global Constraints Christian Bessiere LIRMM, CNRS/U. Montpellier Montpellier, France [removed]

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 192,86 KB