Pages that link to "Item:Q5495770"

The following pages link to A PRG for lipschitz functions of polynomials with applications to sparsest cut (Q5495770):

Displaying 7 items.

• PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
• Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
• Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
• The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
• (Q5002624) (← links)
• Comparison of Metric Spectral Gaps (Q5402099) (← links)
• The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ ₁ (Q5501953) (← links)