Jiatu Li

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 22

Top Topics

Average Case Complexity

Computational Complexity

Top Venues

Electron. Colloquium Comput. Complex.

IACR Cryptol. ePrint Arch.

Publications

Lijie Chen, Jiatu Li, Igor C. Oliveira
. CoRR (2024)
Yilei Chen, Jiatu Li
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. STOC (2024)
Lijie Chen, Jiatu Li, Igor Carboni Oliveira
Reverse Mathematics of Complexity Lower Bounds. Electron. Colloquium Comput. Complex. (2024)
Lijie Chen, Jiatu Li, Igor Carboni Oliveira
. Electron. Colloquium Comput. Complex. (2024)
James Cook, Jiatu Li, Ian Mertz, Edward Pyne
The Structure of Catalytic Space: Capturing Randomness and Time via Compression. Electron. Colloquium Comput. Complex. (2024)
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. STOC (2023)
Yilei Chen, Jiatu Li
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. Electron. Colloquium Comput. Complex. (2023)
Rahul Ilango, Jiatu Li, R. Ryan Williams
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. STOC (2023)
Jiatu Li, Igor Carboni Oliveira
Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. CoRR (2023)
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. Electron. Colloquium Comput. Complex. (2023)
Yilei Chen, Jiatu Li
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. IACR Cryptol. ePrint Arch. 2023 (2023)
Jiatu Li, Igor Carboni Oliveira
Unprovability of strong complexity lower bounds in bounded arithmetic. Electron. Colloquium Comput. Complex. (2023)
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren
Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms. Electron. Colloquium Comput. Complex. (2023)
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)
Lijie Chen, Jiatu Li, Tianqi Yang
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. (2022)
Lijie Chen, Jiatu Li, Tianqi Yang
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC (2022)
Jiatu Li, Tianqi Yang
) circuit lower bounds for explicit functions. STOC (2022)
Zhiyuan Fan, Jiatu Li, Tianqi Yang
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. Electron. Colloquium Comput. Complex. 28 (2021)
Jiatu Li, Tianqi Yang
3.1n - o(n) Circuit Lower Bounds for Explicit Functions. Electron. Colloquium Comput. Complex. 28 (2021)
Zhiyuan Fan, Jiatu Li, Tianqi Yang
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. IACR Cryptol. ePrint Arch. 2021 (2021)
Jiatu Li
Formalization of PAL·S5 in Proof Assistant. CoRR (2020)