Faculty

Institution

Unit

Venue

Subhash Khot

Silver Professor

New York University

Affiliations

Arts & Science

Computer Science

Courant Institute of Mathematical Sciences

Computer Science

Subhash Khot is currently serving as an Arts & Science Silver Professor at New York University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Subhash Khot

New York University

Silver Professor

You can click a keyword to filter the displayed items

applied mathematics computer science machine learning graph theory game theory mathematical optimization theoretical computer science mathematics combinatorial optimization formal methods scientific computing hypergraph theory hardness applied physics numerical analysis computational complexity complexity theory natural language processing automated reasoning computational complexity theory computational game theory vertex cover unique games conjecture unique games closest vector problem computability theory unsupervised machine learning kernel methods independent sets perfect completeness machine learning research logic in computer science approximate reasoning computational learning theory query optimization lattice theory parameterized complexity satisfiability chromatic number shortest vector problem hypergraph vertex cover cut problems integrality gap grassmann graphs sdp gaps approximation algorithms engineering optimization mathematical sciences numerical simulations computational optimization numerical algorithms information technology automated deduction combinatorial theory high resolution communication complexity structure discovery supervised learning fourier analysis scheduling problems scheduling analysis scheduling (computing) finite element methods geometric learning dyeing sat solving constructive approximation proof complexity mathematical modelling analytic number theory spatial computing theoretical modeling optimization problems set disjointness near-optimal lower bounds time complexity theory of computation

Notable Scholarly Works

Notable Federal Grants

Collaborators

Maximum Span Hypothesis: A Potentially Weaker Assumption Than Gap-Eth for Parameterized Complexity. Society for Industrial and Applied Mathematics eBooks (2025)

Karthik C. S.Subhash Khot

maximum span hypothesisparameterized complexityapplied mathematicsmathematics

On Approximability of Satisfiable $K$-Csps: VI. arXiv (Cornell University) (2024)

Bhangale, AmeyKhot, SubhashLiu, Yang P.Minzer, Dor

approximation theoryapproximate reasoningapplied mathematicslogic in computer scienceautomated reasoningcomputer sciencetheory of computationformal methodsformal verificationtheoretical computer sciencesatisfiability

Parallel Repetition for $3$-Player Xor Games. arXiv (Cornell University) (2024)

Bhangale, AmeyBraverman, MarkKhot, SubhashLiu, Yang P.Minzer, Dor

xor gamesalgorithmic game theorycomputer scienceparallel computingparallel repetition

Reasonable Bounds for Combinatorial Lines of Length Three. arXiv (Cornell University) (2024)

Bhangale, AmeyKhot, SubhashLiu, Yang P.Minzer, Dor

combinatorial linesapplied mathematicsalgebraic combinatoricscombinatoricsreasonable boundscombinatorial theorylength three

Effective Bounds for Restricted $3$-Arithmetic Progressions in $\Mathbb{F}_P^N$. arXiv (Cornell University) (2023)

Bhangale, AmeyKhot, SubhashMinzer, Dor

particle physicseffective boundsapplied mathematics

Parallel Repetition for the Ghz Game: Exponential Decay. IEEE Annual Symposium on Foundations of Computer Science (2023)

Mark BravermanSubhash KhotDor Minzer

ghz gamecomputer scienceparallel computingexponential decayparallel repetition

Parallel Repetition of K-Player Projection Games. arXiv (Cornell University) (2023)

Bhangale, AmeyBraverman, MarkKhot, SubhashLiu, Yang P.Minzer, Dor

game theorycomputer sciencek-player projection gamesparallel computingparallel repetition

Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. Annals of Mathematics (2023)

Subhash KhotDor MinzerMuli Safra

applied mathematicsanalytic number theorynumber theorypseudorandom setsgrassmann graphgraph theorynear-perfect expansion

An Invariance Principle for the Multi-Slice, With Applications. IEEE Annual Symposium on Foundations of Computer Science (2022)

Mark BravermanSubhash KhotNoam LifshitzDor Minzer

invariance principledynamical systemsapplied mathematics

Improved Monotonicity Testers via Hypercube Embeddings. arXiv (Cornell University) (2022)

Braverman, MarkKhot, SubhashKindler, GuyMinzer, Dor

hypercube embeddingssoftware testingmonotonicity testerscomputer sciencebenchmark studiesmachine learning

1
2
3
4
5
11
10 / page

Subhash Khot

Silver Professor

New York University

Affiliations

Arts & Science

Computer Science

Courant Institute of Mathematical Sciences

Computer Science

Subhash Khot is currently serving as an Arts & Science Silver Professor at New York University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Subhash Khot

New York University

Silver Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Maximum Span Hypothesis: A Potentially Weaker Assumption Than Gap-Eth for Parameterized Complexity. Society for Industrial and Applied Mathematics eBooks (2025)

Karthik C. S.Subhash Khot

maximum span hypothesisparameterized complexityapplied mathematicsmathematics

On Approximability of Satisfiable $K$-Csps: VI. arXiv (Cornell University) (2024)

Bhangale, AmeyKhot, SubhashLiu, Yang P.Minzer, Dor

Parallel Repetition for $3$-Player Xor Games. arXiv (Cornell University) (2024)

Bhangale, AmeyBraverman, MarkKhot, SubhashLiu, Yang P.Minzer, Dor

xor gamesalgorithmic game theorycomputer scienceparallel computingparallel repetition

Reasonable Bounds for Combinatorial Lines of Length Three. arXiv (Cornell University) (2024)

Bhangale, AmeyKhot, SubhashLiu, Yang P.Minzer, Dor

combinatorial linesapplied mathematicsalgebraic combinatoricscombinatoricsreasonable boundscombinatorial theorylength three

Effective Bounds for Restricted $3$-Arithmetic Progressions in $\Mathbb{F}_P^N$. arXiv (Cornell University) (2023)

Bhangale, AmeyKhot, SubhashMinzer, Dor

particle physicseffective boundsapplied mathematics

Parallel Repetition for the Ghz Game: Exponential Decay. IEEE Annual Symposium on Foundations of Computer Science (2023)

Mark BravermanSubhash KhotDor Minzer

ghz gamecomputer scienceparallel computingexponential decayparallel repetition

Parallel Repetition of K-Player Projection Games. arXiv (Cornell University) (2023)

Bhangale, AmeyBraverman, MarkKhot, SubhashLiu, Yang P.Minzer, Dor

game theorycomputer sciencek-player projection gamesparallel computingparallel repetition

Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. Annals of Mathematics (2023)

Subhash KhotDor MinzerMuli Safra

applied mathematicsanalytic number theorynumber theorypseudorandom setsgrassmann graphgraph theorynear-perfect expansion

An Invariance Principle for the Multi-Slice, With Applications. IEEE Annual Symposium on Foundations of Computer Science (2022)

Mark BravermanSubhash KhotNoam LifshitzDor Minzer

invariance principledynamical systemsapplied mathematics

Improved Monotonicity Testers via Hypercube Embeddings. arXiv (Cornell University) (2022)

Braverman, MarkKhot, SubhashKindler, GuyMinzer, Dor

hypercube embeddingssoftware testingmonotonicity testerscomputer sciencebenchmark studiesmachine learning

1
2
3
4
5
11
10 / page

Similar Faculty Members

Mark Braverman

Institution

Princeton University

computer science

applied mathematics

David Zuckerman

Institution

University of Texas at Austin

cryptographic hardware

discrete algorithm

Ker-I Ko

Institution

Stony Brook University

computational complexity

computational complexity theory

Chen Chen

Institution

New York University

technological forecasting

quantitative management

Aviad Rubinstein

Institution

Stanford University

applied mathematics

computer science

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Ivan Sudborough

Institution

University of Texas at Dallas

automaton network

information security

John Iacono

Institution

New York University

algorithm design

geometry

Chee K. Yap

Institution

New York University

computational mathematics

numerical robustness issues

Similar Faculty Members

Mark Braverman

Institution

Princeton University

computer science

applied mathematics

David Zuckerman

Institution

University of Texas at Austin

cryptographic hardware

discrete algorithm

Ker-I Ko

Institution

Stony Brook University

computational complexity

computational complexity theory

Chen Chen

Institution

New York University

technological forecasting

quantitative management

Aviad Rubinstein

Institution

Stanford University

applied mathematics

computer science

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Ivan Sudborough

Institution

University of Texas at Dallas

automaton network

information security

John Iacono

Institution

New York University

algorithm design

geometry

Chee K. Yap

Institution

New York University

computational mathematics

numerical robustness issues