Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random (Q6083522)
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 7774370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.84607184
0 references
0.84607184
0 references
0.8451967
0 references
0.83555293
0 references
0.8348911
0 references
0.83394396
0 references
0 references
0.82858056
0 references
0.8285338
0 references
0.82678324
0 references
