Column subset selection problem is UG-hard (Q2637653)
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 6257472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Column subset selection problem is UG-hard |
scientific article; zbMATH DE number 6257472 |
Statements
Column subset selection problem is UG-hard (English)
0 references
13 February 2014
0 references
matrices
0 references
subset selection
0 references
hardness
0 references
unique games conjecture
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8492475152015686
0 references
0.8106133341789246
0 references
0.7643466591835022
0 references
0.7566532492637634
0 references
0.7547414898872375
0 references
