This media is still being converted.
This media is pending review .
Many challenging problems in computer science and related fields can be formulated
as constraint satisfaction problems. Such problems consist of a set of discrete
variables and a set of constraints between those variables, and represent a general
class of so-called NP-complete problems. The goal is to find a value assignment to
the variables that satisfies all constraints, generally requiring a search through and
exponentially large space of variable-value assignments.
- Categories:
-
- Tags:
-
