The NP-completeness column (Q4962719)
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 NP-completeness column |
scientific article; zbMATH DE number 6972879
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness column |
scientific article; zbMATH DE number 6972879 |
Statements
The NP-completeness column (English)
0 references
5 November 2018
0 references
approximation algorithms
0 references
unique games conjecture
0 references
clique
0 references
label cover
0 references
lower bounds
0 references
probabilistically checkable proofs
0 references
set cover
0 references
0.841739296913147
0 references
0.8030361533164978
0 references
0.8030361533164978
0 references
0.7985622882843018
0 references
0.7972236275672913
0 references