Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4388671588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon capacity of a union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local orthogonality dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Coding With Side Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Approach to Promise Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hardness results for graph and hypergraph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Index Coding via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Index Codes With Near-Extreme Rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Hardness for Approximate Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with locally few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5060749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of line digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc colorings of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5870293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Hardness of Approximating Chromatic Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Approximating the Network Coding Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal representations and connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal representations over finite fields and the chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the arc-chromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: n-tuple colorings and associated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved hardness for <i>H</i>-colourings of <i>G</i>-colourable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 13:30, 20 August 2024

scientific article; zbMATH DE number 7771537
Language Label Description Also known as
English
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
scientific article; zbMATH DE number 7771537

    Statements

    Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 November 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    orthogonality dimension
    0 references
    minrank
    0 references
    line digraphs
    0 references
    hardness of approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references