Query-to-communication lifting theorems translate lower bounds on query complexity to
lower bounds for the corresponding communication model. In this paper, we give a …

We study the MaxSAT Resolution (MaxRes) rule in the context of certifying unsatisfiability.
We show that it can be exponentially more powerful than tree-like resolution, and when …

In this paper, we establish a low-degree polynomially-sized reduction between tree
ensemble optimization and optimization of multilinear functions over a Cartesian product of …

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to
monotone span program size by Pitassi and Robere (2018) so that it works for any gadget …

Let G be an instance of the stable marriage problem in which every vertex ranks its
neighbors in a strict order of preference. A matching M in G is popular if M does not lose a …

We prove that the extension complexity of the independence polytope of every regular
matroid on n elements is O (n 6). Past results of Wong and Martin on extended formulations …

We show a deterministic simulation (or lifting) theorem for composed problems f◦ Eqn where
the inner function (the gadget) is Equality on n bits. When f is a total function on p bits, it is …

Query-to-communication lifting theorems, which connect the query complexity of a Boolean
function to the communication complexity of an associatedlifted'function obtained by …

We study pseudo-deterministic query complexity-randomized query algorithms that are
required to output the same answer with high probability on all inputs. We prove Ω (√ n) …

Set-disjointness problems are one of the most fundamental problems in communication
complexity and have been extensively studied in past decades. Given its importance, many …