research
∙
05/24/2023
Polynomial-Time Pseudodeterministic Construction of Primes
A randomized algorithm for a search problem is *pseudodeterministic* if ...
share
research
∙
03/27/2022
Constructive Separations and Their Consequences
For a complexity class C and language L, a constructive separation of L ...
research
∙
11/20/2021
Learning algorithms versus automatability of Frege systems
We connect learning algorithms and algorithms automating proof search in...
research
∙
03/15/2021
Pseudodeterministic Algorithms and the Structure of Probabilistic Time
We connect the study of pseudodeterministic algorithms to two major open...
research
∙
11/19/2019
Beyond Natural Proofs: Hardness Magnification and Locality
Hardness magnification reduces major complexity separations (such as EXP...
research
∙
06/16/2018
