research
∙
09/26/2022
On (Simple) Decision Tree Rank
In the decision tree computation model for Boolean functions, the depth ...
share
research
∙
05/26/2022
QBF Merge Resolution is powerful but unnatural
The Merge Resolution proof system (M-Res) for QBFs, proposed by Beyersdo...
research
∙
12/12/2020
Hard QBFs for Merge Resolution
We prove the first proof size lower bounds for the proof system Merge Re...
research
∙
05/23/2020
MaxSAT Resolution and Subcube Sums
We study the MaxRes rule in the context of certifying unsatisfiability. ...
research
∙
03/10/2020
Algebraic Branching Programs, Border Complexity, and Tangent Spaces
Nisan showed in 1991 that the width of a smallest noncommutative single-...
research
∙
01/17/2019