1. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12
2. On small-depth Frege proofs for PHP;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Top-Down Lower Bounds for Depth-Four Circuits;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Borel complexity and Ramsey largeness of sets of oracles separating complexity classes;Mathematical Logic Quarterly;2023-08
5. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02