research
∙
09/30/2022
Pure-Circuit: Strong Inapproximability for PPAD
The current state-of-the-art methods for showing inapproximability in PP...
share
research
∙
05/04/2022
Separations in Proof Complexity and TFNP
It is well-known that Resolution proofs can be efficiently simulated by ...
research
∙
11/03/2020
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
We study search problems that can be solved by performing Gradient Desce...
research
∙
02/26/2020
Consenus-Halving: Does it Ever Get Easier?
In the ε-Consensus-Halving problem, a fundamental problem in fair divisi...
research
∙
02/20/2019
