A μ-constrained Boolean Max-CSP(ψ) instance is a Boolean Max-CSP
instanc...
Constraint satisfaction problems (CSPs) are ubiquitous in theoretical
co...
A μ-biased Max-CSP instance with predicate ψ:{0,1}^r →{0,1}
is an instan...
The UNIQUE GAMES problem is a central problem in algorithms and complexi...
A code is called a q-query locally decodable code (LDC) if there is a
ra...
The problem of learning t-term DNF formulas (for t = O(1)) has been
stud...
The k-Even Set problem is a parameterized variant of the Minimum Distanc...
Graph coloring problems are a central topic of study in the theory of
al...
We identify a new notion of pseudorandomness for randomness sources, whi...
In the classic maximum coverage problem, we are given subsets T_1, ...,
...
The k-Even Set problem is a parameterized variant of the Minimum Distanc...
We prove the hardness of weakly learning halfspaces in the presence of
a...