Seguir
Jiatu Li
Jiatu Li
E-mail confirmado em mit.edu - Página inicial
Título
Citado por
Citado por
Ano
3.1n−o(n) circuit lower bounds for explicit functions
J Li, T Yang
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
292022
Indistinguishability obfuscation, range avoidance, and bounded arithmetic
R Ilango, J Li, RR Williams
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1076-1089, 2023
102023
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
Z Fan, J Li, T Yang
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
92022
Unprovability of strong complexity lower bounds in bounded arithmetic
J Li, IC Oliveira
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1051-1057, 2023
42023
Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
Y Chen, Y Huang, J Li, H Ren
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1058-1066, 2023
32023
Extremely efficient constructions of hash functions, with applications to hardness magnification and PRFs
L Chen, J Li, T Yang
37th Computational Complexity Conference (CCC 2022), 2022
32022
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography
Y Chen, J Li
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 620-629, 2024
2024
On the Unprovability of Circuit Size Bounds in Intuitionistic
L Chen, J Li, IC Oliveira
arXiv preprint arXiv:2404.11841, 2024
2024
Formalization of PALS5 in Proof Assistant
J Li
arXiv preprint arXiv:2012.09388, 2020
2020
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–9