The following pages link to Making the Long Code Shorter (Q3449561):
Displayed 11 items.
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- High order random walks: beyond spectral gap (Q2003767) (← 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)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- (Q5009534) (← links)
- (Q5009543) (← links)
- (Q5090379) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- A Characterization of hard-to-cover CSPs (Q5857608) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)