On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two facts. The first is that in finite or omega-categorical structur...
| Автори: | , , |
|---|---|
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Logical Methods in Computer Science e.V.
2012-09-01
|
| Серія: | Logical Methods in Computer Science |
| Предмети: | |
| Онлайн доступ: | https://lmcs.episciences.org/674/pdf |