Column subset selection problem is UG-hard (Q2637653): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast computation of low-rank matrix approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal Column-Based Matrix Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low‐rank revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Rank Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rank-Revealing Factorisations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating Multicut and Sparsest-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential inapproximability of selecting a maximum volume sub-matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On selecting a maximum volume sub-matrix of a matrix and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column subset selection via sparse approximation of SVD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset selection for matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Sampling and Fast Low-Rank Matrix Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative-Error $CUR$ Matrix Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of pseudoskeleton approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-skeleton approximations by matrices of maximal volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Column-Based Low-Rank Matrix Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Revealing QR Factorizations and the Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Deficient Nonlinear Least Squares Problems and Subset Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensor Selection via Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of unique 2-prover 1-round games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on singular values revealed by QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random vectors in the isotropic position / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002794 / rank
 
Normal rank

Latest revision as of 09:06, 7 July 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
    0 references
    13 February 2014
    0 references
    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 references
    0 references
    0 references