Pages that link to "Item:Q3579207"
From MaRDI portal
The following pages link to Hardness results for approximate hypergraph coloring (Q3579207):
Displayed 4 items.
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← 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)
- Three‐query PCPs with perfect completeness over non‐Boolean domains (Q5311912) (← links)