An algebraic approach to multi-sorted constraints
Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have the same domain. We show here that this apparently minor simplification can in fact change the complexity of the problem, and hence...
Glavni autori: | Bulatov, A, Jeavons, P |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
2003
|
Slični predmeti
-
An algebraic approach to multi−sorted constraints
od: Bulatov, A, i dr.
Izdano: (2003) -
The Complexity of Constraint Satisfaction: An Algebraic Approach
od: Krokhin, A, i dr.
Izdano: (2004) -
Constraint satisfaction problems and finite algebras
od: Bulatov, A, i dr.
Izdano: (2000) -
Constraint satisfaction problems and finite algebras
od: Bulatov, A, i dr.
Izdano: (2000) -
Classifying the complexity of constraints using finite algebras
od: Bulatov, A, i dr.
Izdano: (2005)