The Quest for Strong Inapproximability Results with Perfect Completeness (Q5032036)
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 Quest for Strong Inapproximability Results with Perfect Completeness |
scientific article; zbMATH DE number 7475107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Quest for Strong Inapproximability Results with Perfect Completeness |
scientific article; zbMATH DE number 7475107 |
Statements
The Quest for Strong Inapproximability Results with Perfect Completeness (English)
0 references
16 February 2022
0 references
inapproximability
0 references
constraint satisfaction
0 references
dictatorship testing
0 references
hardness of approximation
0 references
hypergraph coloring
0 references
0.9907297492027284
0 references
0.8108744025230408
0 references
0.8045384883880615
0 references
0.7982628345489502
0 references
0.7928057909011841
0 references
