A randomized algorithm for a search problem is *pseudodeterministic* if ...
For a complexity class C and language L, a constructive separation of L
...
We connect learning algorithms and algorithms automating proof search in...
We connect the study of pseudodeterministic algorithms to two major open...
Hardness magnification reduces major complexity separations (such as
EXP...
We show average-case
lower bounds for explicit Boolean functions again...