The Complexity of Boolean Surjective General-Valued CSPs (Q5111218)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Complexity of Boolean Surjective General-Valued CSPs |
scientific article; zbMATH DE number 7204338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Boolean Surjective General-Valued CSPs |
scientific article; zbMATH DE number 7204338 |
Statements
26 May 2020
0 references
constraint satisfaction problems
0 references
surjective CSP
0 references
valued CSP
0 references
Min-Cut
0 references
polymorphisms
0 references
multimorphisms
0 references
The Complexity of Boolean Surjective General-Valued CSPs (English)
0 references
1.0000001
0 references
0 references
0 references
0.8701227
0 references
0 references
0 references
0.8625129
0 references
0.86190176
0 references
0.86190176
0 references
