Pages that link to "Item:Q3149889"
From MaRDI portal
The following pages link to Hardness of Approximate Hypergraph Coloring (Q3149889):
Displaying 17 items.
- A note on unique games (Q845686) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- An expected polynomial time algorithm for coloring 2-colorable 3-graphs (Q2851504) (← links)
- Function simulation, graph grammars and colourings (Q2855758) (← links)
- 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)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5002681) (← links)
- (Q5092401) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- (Q5869336) (← links)
- (Q5870293) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
