Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
$2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem
Approximate kernel clustering
Grothendieck-type inequalities in combinatorial optimization
No associations
LandOfFree
Subhash Khot does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Subhash Khot, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subhash Khot will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-80103