Author:
Applebaum Benny,Barak Boaz,Xiao David
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the computational complexity of ethics: moral tractability for minds and machines;Artificial Intelligence Review;2024-03-31
2. Learning in Pessiland via Inductive Inference;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Capturing One-Way Functions via NP-Hardness of Meta-Complexity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. NP-Hardness of Learning Programs and Partial MCSP;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Beyond Natural Proofs: Hardness Magnification and Locality;Journal of the ACM;2022-08-23