The following pages link to Subhash A. Khot (Q430831):
Displayed 50 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Item:Q430831 (redirect page) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Nonembeddability theorems via Fourier analysis (Q2491108) (← links)
- (Q2762499) (← links)
- (Q2766822) (← links)
- Evasiveness of Subgraph Containment and Related Properties (Q2784484) (← links)
- On Hardness of Approximating the Parameterized Clique Problem (Q2800551) (← links)
- $\mathcal{NP}$-Hardness of Approximately Solving Linear Equations over Reals (Q2848199) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- Integrality gaps for sparsest cut and minimum linear arrangement problems (Q2931416) (← links)
- On earthmover distance, metric labeling, and 0-extension (Q2931417) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- A characterization of approximation resistance for even k-partite CSPs (Q2986869) (← links)
- (Q3002760) (← links)
- (Q3002802) (← links)
- (Q3002828) (← links)
- Combinatorial theorems about embedding trees on the real line (Q3005116) (← links)
- Hardness of Reconstructing Multivariate Polynomials over Finite Fields (Q3068644) (← links)
- (Q3096713) (← links)
- Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696) (← links)
- (Q3191598) (← links)
- The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics (Q3384132) (← links)
- Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies (Q3395039) (← links)
- Approximate Kernel Clustering (Q3400770) (← links)
- Improved lower bounds on the randomized complexity of graph properties (Q3437025) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Hardness of approximating the shortest vector problem in lattices (Q3546301) (← links)
- (Q3549678) (← links)
- (Q3549718) (← links)
- On Earthmover Distance, Metric Labeling, and 0-Extension (Q3558006) (← links)
- On Agnostic Learning of Parities, Monomials, and Halfspaces (Q3558016) (← links)
- Hardness results for approximate hypergraph coloring (Q3579207) (← links)
- On the power of unique 2-prover 1-round games (Q3579218) (← links)
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (Q3580955) (← links)
- A new multilayered PCP and the hardness of hypergraph vertex cover (Q3581279) (← links)
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (Q3587384) (← links)
- SDP Gaps for 2-to-1 and Other Label-Cover Variants (Q3587413) (← links)
- Approximate Lasserre Integrality Gap for Unique Games (Q3588416) (← links)
- Approximation Algorithms for the Max-Min Allocation Problem (Q3603466) (← links)
- Hardness of Embedding Metric Spaces of Equal Size (Q3603467) (← links)
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion (Q3613762) (← links)
- (Q4535024) (← links)
- On Monotonicity Testing and Boolean Isoperimetric-type Theorems (Q4562273) (← links)