Quasi-random PCP and hardness of 2-catalog segmentation (Q2908876)
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 6073553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-random PCP and hardness of 2-catalog segmentation |
scientific article; zbMATH DE number 6073553 |
Statements
29 August 2012
0 references
hardness of approximation
0 references
PCPs
0 references
catalog segmentation
0 references
Quasi-random PCP and hardness of 2-catalog segmentation (English)
0 references
0.8388693332672119
0 references
0.7828814387321472
0 references
0.7559855580329895
0 references
0.738459587097168
0 references
