The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Tight Approximability Results for Minimum Biclique Cover and Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative Matrix Factorization Requires Irrationality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely restricted matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational and real positive semidefinite rank can be different / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points of the EM algorithm and nonnegative rank boundaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning the parts of objects by non-negative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Boolean matrix ranks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2808527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 17:24, 14 July 2024

scientific article; zbMATH DE number 6804502
Language Label Description Also known as
English
The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions
scientific article; zbMATH DE number 6804502

    Statements

    The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (English)
    0 references
    0 references
    9 November 2017
    0 references
    nonnegative matrix factorization
    0 references
    computational complexity
    0 references
    rank
    0 references
    0 references

    Identifiers

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