Definable inapproximability: new challenges for duplicator (Q5216336): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q127239977, #quickstatements; #temporary_batch_1722463431396 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1806.11307 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127239977 / rank | |||
Normal rank | |||
Latest revision as of 23:19, 31 July 2024
scientific article; zbMATH DE number 7168180
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
