I agree that this site is using cookies. You can find further informations here.
X
Khot, Subhash
117  results:
Search for persons X
?
1

On Approximability of Satisfiable k-CSPs: IV:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 1423-1434 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Parallel Repetition for the GHZ Game: Exponential Decay:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Braverman, Mark ; Khot, Subhash ; Minzer, Dor - p. 1337-1341 , 2023
Link: https://doi.org/10.1109/..
 
?
3

On Approximability of Satisfiable k-CSPs: III:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 643-655 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

On Approximability of Satisfiable k-CSPs: II:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 632-642 , 2023
Link: https://dl.acm.org/doi/1..
 
?
5

An Invariance Principle for the Multi-slice, with Applicati..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Braverman, Mark ; Khot, Subhash ; Lifshitz, Noam. - p. 228-236 , 2022
Link: https://doi.org/10.1109/..
 
?
6

On approximability of satisfiable k-CSPs: I:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash ; Minzer, Dor - p. 976-988 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

Almost polynomial factor inapproximability for parameterize..:

, In: Proceedings of the 37th Computational Complexity Conference,
Karthik, C. S. ; Khot, Subhash - p. 1-21 , 2022
Link: https://dl.acm.org/doi/1..
 
?
8

Optimal inapproximability of satisfiable k-LIN over non-abe..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Bhangale, Amey ; Khot, Subhash - p. 1615-1628 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

On non-optimally expanding sets in Grassmann graphs:

Dinur, Irit ; Khot, Subhash ; Kindler, Guy..
Israel Journal of Mathematics.  243 (2021)  1 - p. 377-420 , 2021
Link: https://doi.org/10.1007/..
 
?
10

The Andoni–Krauthgamer–Razenshteyn Characterization of Sket..:

, In: Springer Optimization and Its Applications; Harmonic Analysis and Applications,
Khot, Subhash ; Naor, Assaf - p. 185-204 , 2020
Link: https://doi.org/10.1007/..
 
?
11

Simultaneous max-cut is harder to approximate than max-cut:

, In: Proceedings of the 35th Computational Complexity Conference,
Bhangale, Amey ; Khot, Subhash - p. 1-15 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

The Andoni-Krauthgamer-Razenshteyn characterization of sket..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Khot, Subhash ; Naor, Assaf - p. 1814-1824 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

UG-hardness to NP-hardness by losing half:

, In: Proceedings of the 34th Computational Complexity Conference,
Bhangale, Amey ; Khot, Subhash - p. 1-20 , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

Near-optimal approximation algorithm for simultaneous Max-C..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhangale, Amey ; Khot, Subhash ; Kopparty, Swastik.. - p. 1407-1425 , 2018
Link: https://doi.org/10.1137/..
 
?
15

Near-optimal approximation algorithm for simultaneous Max-C..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhangale, Amey ; Khot, Subhash ; Kopparty, Swastik.. - p. 1407-1425 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15