No photo of Subhash Khot

Subhash Khot

Silver Professor; Professor of Computer Science

20002019
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Weighted list of dominant concepts in the researcher's publications (titles and abstracts).

  • 5 Similar Profiles
Hardness Engineering & Materials Science
Polynomials Engineering & Materials Science
Inapproximability Mathematics
Approximation algorithms Engineering & Materials Science
Game Mathematics
Linear equations Engineering & Materials Science
Coloring Engineering & Materials Science
Vertex Cover Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2000 2019

Improved 3LIN hardness via linear label cover

Harsha, P., Khot, S., Lee, E. & Thiruvenkatachari, D., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Labels
Hardness
Polynomials

The Andoni–Krauthgamer–Razenshteyn characterization of sketchable norms fails for sketchable metrics

Khot, S. & Naor, A., Jan 1 2019, p. 1814-1824. 11 p.

Research output: Contribution to conferencePaper

Sketching
Normed Space
Norm
Metric
Metric space

UG-hardness to NP-hardness by losing half

Bhangale, A. & Khot, S., Jul 1 2019, 34th Computational Complexity Conference, CCC 2019. Shpilka, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 137).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hardness

An improved dictatorship test with perfect completeness

Bhangale, A., Khot, S. & Thiruvenkatachari, D., Jan 1 2018, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 93. 15

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Constraint satisfaction problems
Boolean functions
Hardness

Near-optimal approximation algorithm for simultaneous Max-cut

Bhangale, A., Khot, S., Kopparty, S., Sachdeva, S. & Thiruvenkatachari, D., Jan 1 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Association for Computing Machinery, p. 1407-1425 19 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Max-cut
Optimal Approximation
Approximation algorithms
Optimal Algorithm
Approximation Algorithms