Pages that link to "Item:Q2968149"
From MaRDI portal
The following pages link to Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149):
Displaying 8 items.
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← 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)
- (Q5002681) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- (Q5259597) (redirect page) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
