On perfect \(0,\pm 1\) matrices (Q1356731): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Polynomial-time inference of all valid implications for Horn and related formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Index for Satisfiability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral sets having a least element / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(96)00163-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1869946094 / rank
 
Normal rank

Latest revision as of 08:29, 30 July 2024

scientific article
Language Label Description Also known as
English
On perfect \(0,\pm 1\) matrices
scientific article

    Statements

    Identifiers

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