The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity.

Zhiyuan Fan, Jiatu Li, Tianqi Yang

Browse the full STOC paper archive.