On the complexity of Boolean matrix ranks (Q2435409): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Properties of MPC for max-plus-linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-algebra: The linear algebra of combinatorics? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong regularity of matrices -- a survey of results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A condition for the strong regularity of matrices in the minimax algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two lower-bound methods for communication complexity / 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: Fooling-sets and rank in nonzero characteristic (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and applications of (max,+) linear algebra / rank
 
Normal rank

Latest revision as of 08:34, 7 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of Boolean matrix ranks
scientific article

    Statements

    Identifiers

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