Pages that link to "Item:Q5384079"
From MaRDI portal
The following pages link to Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs (Q5384079):
Displayed 8 items.
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← 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)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- (Q6176154) (← links)