Column subset selection problem is UG-hard (Q2637653): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Algorithm 853 / rank | |||
Normal rank |
Revision as of 12:07, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Column subset selection problem is UG-hard |
scientific article |
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