Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs |
scientific article |
Statements
Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (English)
0 references
11 November 2020
0 references
constraint satisfaction problems
0 references
valued constraint satisfaction problems
0 references
surjective VCSPs
0 references
Min-Cut
0 references
