Jiatu Li

According to our database1, Jiatu Li authored at least 11 papers between 2020 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Unprovability of strong complexity lower bounds in bounded arithmetic.
Electron. Colloquium Comput. Complex., 2023

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic.
Electron. Colloquium Comput. Complex., 2023

Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography.
Electron. Colloquium Comput. Complex., 2023

Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms.
Electron. Colloquium Comput. Complex., 2023

Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs.
Electron. Colloquium Comput. Complex., 2022

3.1<i>n</i> - <i>o</i>(<i>n</i>) circuit lower bounds for explicit functions.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
3.1n - o(n) Circuit Lower Bounds for Explicit Functions.
Electron. Colloquium Comput. Complex., 2021

The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs.
Electron. Colloquium Comput. Complex., 2021

2020
Formalization of PAL·S5 in Proof Assistant.
CoRR, 2020


  Loading...