Definable Inapproximability: New Challenges for Duplicator (Q5079727)
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 7533332
| 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 7533332 |
Statements
28 May 2022
0 references
descriptive compleixty
0 references
hardness of approximation
0 references
max SAT
0 references
vertex cover
0 references
fixed-point logic with counting
0 references
Definable Inapproximability: New Challenges for Duplicator (English)
0 references
0.9994893074035645
0 references
0.8019879460334778
0 references
0.7770642638206482
0 references
0.7676332592964172
0 references
