Publications
- Addition Is Exponentially Harder Than Counting for Shallow Monotone Circuits2017 | Faculty of Mathematics and Physics
- On monotone circuits with local oracles and clique lower bounds2019 | Faculty of Mathematics and Physics
- UNPROVABILITY OF CIRCUIT UPPER BOUNDS IN COOK'S THEORY PV2017 | Faculty of Mathematics and Physics
- Pseudodeterministic Constructions in Subexponential Time2017 | Faculty of Mathematics and Physics
- Erdos-Ko-Rado for Random Hypergraphs: Asymptotics and Stability2017 | Faculty of Mathematics and Physics
- Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness2017 | Faculty of Mathematics and Physics
- Near-Optimal Small-Depth Lower Bounds for Small2016 | Faculty of Mathematics and Physics
Loading network view...