Author:
Applebaum Benny,Barak Boaz,Xiao David
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Learning in Pessiland via Inductive Inference;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Capturing One-Way Functions via NP-Hardness of Meta-Complexity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. NP-Hardness of Learning Programs and Partial MCSP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Beyond Natural Proofs: Hardness Magnification and Locality;Journal of the ACM;2022-08-23
5. On Worst-Case Learning in Relativized Heuristica;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02