
Unambiguous DNFs and AlonSaksSeymour
We exhibit an unambiguous kDNF formula that requires CNF width Ω̃(k^2),...
read it

On the Power and Limitations of Branch and Cut
The Stabbing Planes proof system was introduced to model the reasoning c...
read it

When Is Amplification Necessary for Composition in Randomized Query Complexity?
Suppose we have randomized decision trees for an outer function f and an...
read it

Automating Cutting Planes is NPHard
We show that Cutting Planes (CP) proofs are hard to find: Given an unsat...
read it

The Power of Many Samples in Query Complexity
The randomized query complexity R(f) of a boolean function f{0,1}^n→{0,1...
read it

On the Complexity of Moduloq Arguments and the ChevalleyWarning Theorem
We study the search problem class PPA_q defined as a moduloq analog of ...
read it

NearOptimal Communication Lower Bounds for Approximate Nash Equilibria
We prove an N^2o(1) lower bound on the randomized communication complex...
read it
Mika Göös
is this you? claim profile