| 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 | 25 | 2022 |
| 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 | 9 | 2022 |
| 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 | 7 | 2023 |
| 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 | 3 | 2023 |
| 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 | 3 | 2022 |
| 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 | 2 | 2023 |
| Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography Y Chen, J Li Cryptology ePrint Archive, 2023 | | 2023 |
| Formalization of PALS5 in Proof Assistant J Li arXiv preprint arXiv:2012.09388, 2020 | | 2020 |
Richard Ryan WilliamsMITVerified email at mit.edu
