A birthday repetition theorem and complexity of approximating dense CSPs (Q5111409)
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: A birthday repetition theorem and complexity of approximating dense CSPs |
scientific article; zbMATH DE number 7204530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A birthday repetition theorem and complexity of approximating dense CSPs |
scientific article; zbMATH DE number 7204530 |
Statements
27 May 2020
0 references
birthday repetition
0 references
constraint satisfaction problems
0 references
linear program
0 references
0.806008517742157
0 references
0.7566807866096497
0 references
0.7549454569816589
0 references
0.7518274784088135
0 references
