The following pages link to Venkatesan Guruswami (Q293456):
Displaying 5 items.
- On the list-decodability of random linear codes (Q2875168) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Approximate Hypergraph Coloring (Q3149889) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_p\) norms (Q6499250) (← links)
- SDPs and robust satisfiability of promise CSP (Q6499252) (← links)
