logo
  • Articles
  • Editors
  • Submit
  • Search
  • Home
  • About
  • Articles
  • Special Issues
  • Graduate Surveys
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles by Subhash Khot
Vol 18, Article 5 (pp 1-28) [CCC19 Spec Issue]
UG-hardness to NP-hardness by Losing Half
by Amey Bhangale and Subhash Khot
Vol 9, Article 28 (pp 863-887) [Boolean Spec Issue]
A Two-Prover One-Round Game with Strong Soundness
by Subhash Khot and Muli Safra
Vol 7, Article 3 (pp 27-43)
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
by Per Austrin, Subhash Khot, and Muli Safra
Vol 5, Article 4 (pp 83-117)
SDP Gaps and UGC-hardness for Max-Cut-Gain
by Subhash Khot and Ryan O'Donnell
Vol 1, Article 7 (pp 119-148)
Query Efficient PCPs with Perfect Completeness
by Johan Håstad and Subhash Khot