Range Avoidance (AVOID) is a total search problem where, given a Boolean...
We study the problem of designing worst-case to average-case reductions ...
We study the complexity of lattice problems in a world where algorithms,...
The Strong Exponential Time Hypothesis (SETH) asserts that for every
ε>0...
We analyze the sketching approximability of constraint satisfaction prob...
We present a new framework for designing worst-case to average-case
redu...
Since 1989, the best known lower bound on static data structures was Sie...
We consider the approximability of constraint satisfaction problems in t...
A constraint satisfaction problem (CSP), Max-CSP( F), is specified by
a ...
A Boolean constraint satisfaction problem (CSP), Max-CSP(f), is a
maximi...
We prove tight upper and lower bounds on approximation ratios of all Boo...
The orthogonality dimension of a graph G=(V,E) over a field 𝔽 is
the sma...
We show that the Closest Vector Problem in the ℓ_p norm
(CVP_p) cannot b...
The next Moscow City Duma elections will be held on September 8th with a...
Given a set of integers {a_1, ..., a_N}, the 3SUM problem requires
findi...
Label tree-based algorithms are widely used to tackle multi-class and
mu...
We quantify the separation between the numbers of labeled examples requi...
The best known circuit lower bounds against unrestricted circuits remain...
We show that static data structure lower bounds in the group (linear) mo...
In the Shortest Common Superstring (SCS) problem, one is given a collect...
Detecting patterns in strings and images is a fundamental and well studi...