research
∙
05/24/2023
Polynomial-Time Pseudodeterministic Construction of Primes
A randomized algorithm for a search problem is *pseudodeterministic* if ...
share
research
∙
05/11/2023
Constant-depth circuits vs. monotone circuits
We establish new separations between the power of monotone and general (...
research
∙
05/29/2022
Theory and Applications of Probabilistic Kolmogorov Complexity
Diverse applications of Kolmogorov complexity to learning [CIKK16], circ...
research
∙
04/18/2022
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity
The classical coding theorem in Kolmogorov complexity states that if an ...
research
∙
03/15/2021
Pseudodeterministic Algorithms and the Structure of Probabilistic Time
We connect the study of pseudodeterministic algorithms to two major open...
research
∙
12/03/2020
Quantum learning algorithms imply circuit lower bounds
We establish the first general connection between the design of quantum ...
research
∙
11/19/2019
Beyond Natural Proofs: Hardness Magnification and Locality
Hardness magnification reduces major complexity separations (such as EXP...
research
∙
05/30/2019