Pages that link to "Item:Q2851860"
From MaRDI portal
The following pages link to Improved Hardness of Approximating Chromatic Number (Q2851860):
Displayed 8 items.
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- (Q5091214) (← links)
- (Q5092472) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)