Pages that link to "Item:Q1939669"
From MaRDI portal
The following pages link to Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669):
Displaying 12 items.
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Computing approximate Fekete points by QR factorizations of Vandermonde matrices (Q971636) (← links)
- On selecting a maximum volume sub-matrix of a matrix and related problems (Q1034598) (← links)
- Column subset selection is NP-complete (Q2228097) (← links)
- Linear-time CUR approximation of BEM matrices (Q2292005) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Matrices with Hierarchical Low-Rank Structures (Q2971626) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
- Optimal Interpolation and Compatible Relaxation in Classical Algebraic Multigrid (Q5745132) (← links)
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions (Q6052452) (← links)
- Polynomial time \(\rho\)-locally maximum volume search (Q6073869) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)