author-photo

Subhash Khot

New York University
Georgia Institute of Technology
Princeton University

215

Papers

7765

Citations

Citation Trend

Filter By

Papers (215) Sort By

Journal Conference Others

Optimal inapproximability of satisfiable k-LIN over non-abelian groups

2021 | ACM Symposium on Theory of Computing
- Amey Bhangale
- Subhash Khot
Show All
- Source
- Cite
- Save
Citations (0)
An Invariance Principle for the Multi-slice, with Applications

2021 arXiv: Computational Complexity
Show All
- Source
- Cite
- Save
Citations (2)
On Rich 2-to-1 Games.

2021
Show All
- Source
- Cite
- Save
Citations (2)
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality.

2021
Show All
- Source
- Cite
- Save
Citations (1)
On non-optimally expanding sets in Grassmann graphs

2021 Israel Journal of Mathematics
Show All
- Source
- Cite
- Save
Citations (0)
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups.

2020
- Amey Bhangale
- Subhash Khot
Show All
- Source
- Cite
- Save
Citations (0)
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.

2020
- Amey Bhangale
- Subhash Khot
Show All
- Source
- Cite
- Save
Citations (1)
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups.

2020
- Amey Bhangale
- Subhash Khot
Show All
- Source
- Cite
- Save
Citations (1)
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut

2020 CCC | Conference on Computational Complexity
- Amey Bhangale
- Subhash Khot
Show All
- Source
- Cite
- Save
Citations (0)
Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality.

2020 Electronic Colloquium on Computational Complexity
Show All
- Source
- Cite
- Save
Citations (1)