Pages that link to "Item:Q891178"

The following pages link to PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178):

Displayed 5 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)
• Hardness of Rainbow Coloring Hypergraphs (Q5136325) ‎ (← links)
• A Characterization of hard-to-cover CSPs (Q5857608) ‎ (← links)