research
∙
08/18/2023
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs
A μ-constrained Boolean Max-CSP(ψ) instance is a Boolean Max-CSP instanc...
share
research
∙
05/23/2022
Approximating CSPs with Outliers
Constraint satisfaction problems (CSPs) are ubiquitous in theoretical co...
research
∙
01/12/2022
A Characterization of Approximability for Biased CSPs
A μ-biased Max-CSP instance with predicate ψ:{0,1}^r →{0,1} is an instan...
research
∙
05/18/2020
Approximation Algorithms and Hardness for Strong Unique Games
The UNIQUE GAMES problem is a central problem in algorithms and complexi...
research
∙
11/25/2019
Combinatorial lower bounds for 3-query LDCs
A code is called a q-query locally decodable code (LDC) if there is a ra...
research
∙
11/14/2019
Hardness of Learning DNFs using Halfspaces
The problem of learning t-term DNF formulas (for t = O(1)) has been stud...
research
∙
09/04/2019
Parameterized Intractability of Even Set and Shortest Vector Problem
The k-Even Set problem is a parameterized variant of the Minimum Distanc...
research
∙
08/30/2019
Approximation Algorithms for Partially Colorable Graphs
Graph coloring problems are a central topic of study in the theory of al...
research
∙
05/28/2019
Average Bias and Polynomial Sources
We identify a new notion of pseudorandomness for randomness sources, whi...
research
∙
05/02/2019
Tight Approximation Bounds for Maximum Multi-Coverage
In the classic maximum coverage problem, we are given subsets T_1, ..., ...
research
∙
03/26/2018
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
The k-Even Set problem is a parameterized variant of the Minimum Distanc...
research
∙
07/06/2017
