Pages that link to "Item:Q2637653"
From MaRDI portal
The following pages link to Column subset selection problem is UG-hard (Q2637653):
Displaying 9 items.
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Optimal column subset selection for image classification by genetic algorithms (Q1621645) (← links)
- Clustering, multicollinearity, and singular vectors (Q2143037) (← links)
- Regularized greedy column subset selection (Q2215118) (← links)
- Column subset selection is NP-complete (Q2228097) (← links)
- Perspectives on CUR decompositions (Q2300772) (← links)
- Estimating Leverage Scores via Rank Revealing Methods and Randomization (Q5006452) (← links)
- Robust CUR Decomposition: Theory and Imaging Applications (Q5860372) (← links)
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores (Q6599985) (← links)
