default search action
Jiatu Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Yilei Chen
, Jiatu Li
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. STOC 2024: 620-629 - [i17]Lijie Chen, Jiatu Li, Igor C. Oliveira:
On the Unprovability of Circuit Size Bounds in Intuitionistic S12. CoRR abs/2404.11841 (2024) - [i16]Lijie Chen, Jiatu Li, Jingxun Liang:
Maximum Circuit Lower Bounds for Exponential-time Arthur Merlin. Electron. Colloquium Comput. Complex. TR24: TR24-182 (2024) - [i15]Lijie Chen, Jiatu Li, Igor Carboni Oliveira:
Reverse Mathematics of Complexity Lower Bounds. Electron. Colloquium Comput. Complex. TR24 (2024) - [i14]Lijie Chen, Jiatu Li, Igor Carboni Oliveira:
On the Unprovability of Circuit Size Bounds in Intuitionistic S12. Electron. Colloquium Comput. Complex. TR24 (2024) - [i13]James Cook, Jiatu Li, Ian Mertz, Edward Pyne:
The Structure of Catalytic Space: Capturing Randomness and Time via Compression. Electron. Colloquium Comput. Complex. TR24 (2024) - [i12]Jiatu Li, Edward Pyne, Roei Tell:
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c6]Jiatu Li, Igor C. Oliveira:
Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. STOC 2023: 1051-1057 - [c5]Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. STOC 2023: 1058-1066 - [c4]Rahul Ilango, Jiatu Li, R. Ryan Williams
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. STOC 2023: 1076-1089 - [i11]Jiatu Li, Igor Carboni Oliveira:
Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic. CoRR abs/2305.15235 (2023) - [i10]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. TR23 (2023) - [i9]Yilei Chen, Jiatu Li:
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. Electron. Colloquium Comput. Complex. TR23 (2023) - [i8]Rahul Ilango, Jiatu Li, Ryan Williams:
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. Electron. Colloquium Comput. Complex. TR23 (2023) - [i7]Jiatu Li, Igor Carboni Oliveira:
Unprovability of strong complexity lower bounds in bounded arithmetic. Electron. Colloquium Comput. Complex. TR23 (2023) - [i6]Yilei Chen, Jiatu Li:
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. IACR Cryptol. ePrint Arch. 2023: 1894 (2023) - 2022
- [c3]Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. CCC 2022: 23:1-23:37 - [c2]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: 962-975 - [c1]Jiatu Li, Tianqi Yang:
3.1n - o(n) circuit lower bounds for explicit functions. STOC 2022: 1180-1193 - [i5]Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i4]Zhiyuan Fan, Jiatu Li, Tianqi Yang
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i3]Jiatu Li, Tianqi Yang
3.1n - o(n) Circuit Lower Bounds for Explicit Functions. Electron. Colloquium Comput. Complex. TR21 (2021) - [i2]Zhiyuan Fan, Jiatu Li, Tianqi Yang:
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. IACR Cryptol. ePrint Arch. 2021: 1079 (2021) - 2020
- [i1]Jiatu Li:
Formalization of PAL·S5 in Proof Assistant. CoRR abs/2012.09388 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: