The complexity of promise SAT on non-Boolean domains (Q5066145)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7499574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of promise SAT on non-Boolean domains |
scientific article; zbMATH DE number 7499574 |
Statements
The Complexity of Promise SAT on Non-Boolean Domains (English)
0 references
29 March 2022
0 references
promise constraint satisfaction
0 references
PCSP
0 references
polymorphisms
0 references
algebraic approach
0 references
label cover
0 references
0.8603746891021729
0 references
0.858850359916687
0 references
0.8394383788108826
0 references
0.7913628220558167
0 references
0.7857282161712646
0 references
