What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Unique games conjecture, Approximation algorithm and Conjecture.
His study on Hardness of approximation, Binary logarithm and Boolean function is often connected to Set theory as part of broader study in Combinatorics.
His Discrete mathematics research is multidisciplinary, incorporating elements of Computational complexity theory and Graph theory.
His Unique games conjecture research is multidisciplinary, incorporating perspectives in Graph, Grothendieck inequality and Maximum cut.
His work in Approximation algorithm addresses subjects such as Combinatorial optimization, which are connected to disciplines such as Monotone polygon and Submodular set function.
His Vertex cover study combines topics from a wide range of disciplines, such as Theory of computing and Constant factor.
His most cited work include:
- On the power of unique 2-prover 1-round games (810 citations)
- Vertex cover might be hard to approximate to within 2-ε (586 citations)
- Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? (473 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Combinatorics, Discrete mathematics, Unique games conjecture, Hardness of approximation and Approximation algorithm.
His Combinatorics study incorporates themes from Computational complexity theory and Constant.
The study incorporates disciplines such as Function and Fraction in addition to Discrete mathematics.
His Unique games conjecture study also includes
- Maximum cut which intersects with area such as Rounding and Grothendieck inequality,
- Embedding most often made with reference to Reduction.
Subhash Khot combines subjects such as PCP theorem, Bipartite graph and Finite field with his study of Hardness of approximation.
His Approximation algorithm study deals with Time complexity intersecting with Vertex.
He most often published in these fields:
- Combinatorics (77.19%)
- Discrete mathematics (64.33%)
- Unique games conjecture (28.07%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (77.19%)
- Discrete mathematics (64.33%)
- Boolean function (9.36%)
In recent papers he was focusing on the following fields of study:
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Boolean function, Conjecture and Function.
His Combinatorics study typically links adjacent topics like Small set.
His Boolean function research incorporates themes from Property testing and Mathematical proof.
His specific area of interest is Conjecture, where Subhash Khot studies Unique games conjecture.
His Function research focuses on Integer and how it connects with Variable.
He has included themes like Vertex, Maximum cut, Rounding and Approximation algorithm in his Time complexity study.
Between 2016 and 2021, his most popular works were:
- On independent sets, 2-to-2 games, and Grassmann graphs (27 citations)
- Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. (25 citations)
- Towards a proof of the 2-to-1 games conjecture? (18 citations)
In his most recent research, the most cited papers focused on:
- Algebra
- Combinatorics
- Real number
Subhash Khot mainly focuses on Combinatorics, Graph, Small set, Conjecture and Vertex cover.
As part of his studies on Combinatorics, Subhash Khot often connects relevant areas like Pseudorandom number generator.
He integrates many fields, such as Small set, Completeness, Linearity, Imperfect and Cover, in his works.
The various areas that Subhash Khot examines in his Vertex cover study include Feedback vertex set, Independent set and Vertex.
Subhash Khot connects Maximal independent set with Discrete mathematics in his study.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
