Classifying the complexity of constraints using finite algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. Here we show that any set of relations used to specify the allowed...
主要な著者: | Bulatov, A, Jeavons, P, Krokhin, A |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
2005
|
類似資料
-
Classifying the complexity of constraints using finite algebras
著者:: Bulatov, A, 等
出版事項: (2005) -
Constraint satisfaction problems and finite algebras
著者:: Bulatov, A, 等
出版事項: (2000) -
Constraint satisfaction problems and finite algebras
著者:: Bulatov, A, 等
出版事項: (2000) -
The Complexity of Constraint Satisfaction: An Algebraic Approach
著者:: Krokhin, A, 等
出版事項: (2004) -
The complexity of maximal constraint languages
著者:: Bulatov, A, 等
出版事項: (2001)