# Binary CSP

A constraint satisfaction problem is binary if all constraints are either unary or binary relations (wrt the decision variables). That is, the cardinality of the scope of the constraint is either 1 or 2. For example, $LaTeX: x > 2$ (unary) or $LaTeX: x \neq y$ (binary).