Subhash Khot

collaborators

3 papers

cs.CC2025

An Invariance Principle for the Multi-slice, with Applications

Mark Braverman, Subhash Khot, Noam Lifshitz +1

Given an alphabet size $m \in N$ thought of as a constant, and $k = (k_{1}, \dots, k_{m})$ whose entries sum of up $n$ , the $k$ -multi-slice is the set of vectors $x\i…

cs.CC2025

Almost Polynomial Factor Inapproximability for Parameterized k-Clique

Karthik C. S., Subhash Khot

The k-Clique problem is a canonical hard problem in parameterized complexity. In this paper, we study the parameterized complexity of approximating the k-Clique problem where an in…

math.CO2024

Effective Bounds for Restricted $3$ -Arithmetic Progressions in $F_{p}^{n}$

Amey Bhangale, Subhash Khot, Dor Minzer

For a prime $p$ , a restricted arithmetic progression in $F_{p}^{n}$ is a triplet of vectors $x, x + a, x + 2 a$ in which the common difference $a$ is a non-zero element from $\{0,1…

An Invariance Principle for the Multi-slice, with Applications

Almost Polynomial Factor Inapproximability for Parameterized k-Clique

Effective Bounds for Restricted 3-Arithmetic Progressions in Fpn​

Effective Bounds for Restricted $3$ -Arithmetic Progressions in $F_{p}^{n}$