Zhiyuan Fan, Jiatu Li, Tianqi Yang 0001. The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 962-975, ACM, 2022. [doi]
Abstract is missing.