Identity Testing for Circuits with Exponentiation Gates
Jiatu Li, Mengdi Wu. Identity Testing for Circuits with Exponentiation Gates. ITCS, 2026.
Jiatu Li, Mengdi Wu. Identity Testing for Circuits with Exponentiation Gates. ITCS, 2026.
Lijie Chen, Jiatu Li, Igor C. Oliveira. On the Unprovability of Circuit Size Bounds in Intuitionistic $S^1_2$. LMCS, 2025, Volume 21, Issue 3.
Lijie Chen, Jiatu Li, Jingxun Liang. Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin. STOC, 2025.
James Cook, Jiatu Li, Ian Mertz, Edward Pyne. The Structure of Catalytic Space: Capturing Randomness and Time via Compression. STOC, 2025.
Lijie Chen, Jiatu Li, Igor C. Oliveira. Reverse Mathematics of Complexity Lower Bounds. FOCS, 2024.
Jiatu Li, Edward Pyne, Roei Tell. Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. FOCS, 2024.
Yilei Chen, Jiatu Li. Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. STOC, 2024.
Jiatu Li, Igor C. Oliveira. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. STOC, 2023.
Rahul Ilango, Jiatu Li, Ryan Williams. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. STOC, 2023.
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren. Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms. STOC, 2023.
Lijie Chen, Jiatu Li, Tianqi Yang. Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC, 2022.
Zhiyuan Fan, Jiatu Li, Tianqi Yang. The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in Computational Complexity. STOC, 2022.
Jiatu Li, Tianqi Yang. 3.1n-o(n) Circuit Lower Bounds for Explicit Functions. STOC, 2022.