research
∙
05/04/2022
Separations in Proof Complexity and TFNP
It is well-known that Resolution proofs can be efficiently simulated by ...
share
research
∙
02/17/2022
Proofs, Circuits, and Communication
We survey lower-bound results in complexity theory that have been obtain...
research
∙
02/15/2022
Further Collapses in TFNP
We show =∩. Here the class consists of all total search problems that r...
research
∙
02/09/2021
On the Power and Limitations of Branch and Cut
The Stabbing Planes proof system was introduced to model the reasoning c...
research
∙
07/06/2020
KRW Composition Theorems via Lifting
One of the major open problems in complexity theory is proving super-log...
research
∙
01/08/2020
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling
We establish an exactly tight relation between reversible pebblings of g...
research
∙
01/07/2020
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
We significantly strengthen and generalize the theorem lifting Nullstell...
research
∙
10/09/2017
Stabbing Planes
We introduce and develop a new semi-algebraic proof system, called Stabb...
research
∙
06/26/2017