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...
প্রধান লেখক: | , , |
---|---|
বিন্যাস: | Journal article |
ভাষা: | English |
প্রকাশিত: |
2005
|