Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
CorrectionBot (talk | contribs)
Changed label, description and/or aliases in en, and other parts
 
(6 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6244634
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.07.001 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131716254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive algorithm in searching for many edges in a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The union of minimal hitting sets: parameterized combinatorial bounds and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse nonnegative solution of underdetermined linear equations by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for \(d\)-hitting set: the weighted case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group testing problem for graphs with several defective edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3560376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximate Solutions to Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group testing problem for hypergraphs of bounded rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.07.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:29, 2 July 2025

scientific article; zbMATH DE number 6244634
Language Label Description Also known as
English
Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
scientific article; zbMATH DE number 6244634

    Statements

    Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (English)
    0 references
    0 references
    13 January 2014
    0 references
    sparse vector
    0 references
    linear system
    0 references
    hitting set
    0 references
    parameterized algorithm
    0 references
    enumeration
    0 references
    problem kernel
    0 references
    group testing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references