The following pages link to Rishi Saket (Q619908):
Displayed 26 items.
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- On the approximability of digraph ordering (Q2408167) (← links)
- Stochastic Vehicle Routing with Recourse (Q2843266) (← links)
- The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
- Quasi-Random PCP and Hardness of 2-Catalog Segmentation (Q2908876) (← links)
- Integrality gaps for sparsest cut and minimum linear arrangement problems (Q2931416) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields (Q3068644) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- New and Improved Bounds for the Minimum Set Cover Problem (Q3167404) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs (Q3453563) (← links)
- (Q3549718) (← links)
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (Q3587391) (← links)
- Approximate Lasserre Integrality Gap for Unique Games (Q3588416) (← links)
- Hardness of Embedding Metric Spaces of Equal Size (Q3603467) (← links)
- Tight Hardness of the Non-commutative Grothendieck Problem (Q4602402) (← links)
- On the hardness of learning sparse parities (Q4606280) (← links)
- Hardness of Bipartite Expansion. (Q4606326) (← links)
- Bypassing UGC from Some Optimal Geometric Inapproximability Results (Q4962201) (← links)
- (Q5136319) (← links)
- Hardness of Rainbow Coloring Hypergraphs (Q5136325) (← links)
- SDP Integrality Gaps with Local ell_1-Embeddability (Q5171220) (← links)
- Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs (Q5384079) (← links)
- (Q5743431) (← links)
- Hardness of learning DNFs using halfspaces (Q6087018) (← links)