Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random (Q6083522)
From MaRDI portal
scientific article; zbMATH DE number 7774370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random |
scientific article; zbMATH DE number 7774370 |
Statements
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random (English)
0 references
8 December 2023
0 references
CSP refutation
0 references
even covers
0 references
smoothed CSPs
0 references
