
Approximation Algorithms and Hardness for Strong Unique Games
The UNIQUE GAMES problem is a central problem in algorithms and complexi...
read it

Combinatorial lower bounds for 3query LDCs
A code is called a qquery locally decodable code (LDC) if there is a ra...
read it

Hardness of Learning DNFs using Halfspaces
The problem of learning tterm DNF formulas (for t = O(1)) has been stud...
read it

Parameterized Intractability of Even Set and Shortest Vector Problem
The kEven Set problem is a parameterized variant of the Minimum Distanc...
read it

Approximation Algorithms for Partially Colorable Graphs
Graph coloring problems are a central topic of study in the theory of al...
read it

Average Bias and Polynomial Sources
We identify a new notion of pseudorandomness for randomness sources, whi...
read it

Tight Approximation Bounds for Maximum MultiCoverage
In the classic maximum coverage problem, we are given subsets T_1, ..., ...
read it

Parameterized Intractability of Even Set and Shortest Vector Problem from GapETH
The kEven Set problem is a parameterized variant of the Minimum Distanc...
read it

Hardness of learning noisy halfspaces using polynomial thresholds
We prove the hardness of weakly learning halfspaces in the presence of a...
read it
Suprovat Ghoshal
is this you? claim profile