Boolean symmetric vs. functional PCSP dichotomy
As our first result, we establish a dichotomy for promise constraint satisfaction problems of the form PCSP(A, B), where A is Boolean and symmetric and B is functional (on a domain of any size); i.e, all but one element of any tuple in a relation in B determine the last element. This includes PCSPs...
| Автори: | , |
|---|---|
| Формат: | Conference item |
| Мова: | English |
| Опубліковано: |
IEEE
2023
|