Definable inapproximability: new challenges for duplicator (Q5216336)
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 7168180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Definable inapproximability: new challenges for duplicator |
scientific article; zbMATH DE number 7168180 |
Statements
Definable inapproximability: new challenges for duplicator (English)
0 references
17 February 2020
0 references
descriptive complexity
0 references
hardness of approximation
0 references
MAX SAT
0 references
vertex cover
0 references
fixed-point logic with counting
0 references
0.9999999
0 references
0.81295425
0 references
0.8104062
0 references
0.8022244
0 references
0.80104464
0 references
0 references
0.79958487
0 references
