Many column subset selection criteria are NP-hard for small k and most lack polynomial-time approximation schemes.
Osinsky,Polynomial timeρ-locally maximum volume search, Calcolo, 60 (2023), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Many (most?) column subset selection criteria are NP hard for a few columns
Many column subset selection criteria are NP-hard for small k and most lack polynomial-time approximation schemes.