NP-Hardness of Learning Programs and Partial MCSP-Reference-Cited by-同舟云学术

NP-Hardness of Learning Programs and Partial MCSP

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Hirahara Shuichi¹

Affiliation:

1. Principles of Informatics Research Division National Institute of Informatics,Tokyo,Japan

Publisher

IEEE

Link

Reference79 articles.

3. From Local Pseudorandom Generators to Hardness of Learning;daniely;In Proceedings of the Conference on Computational Learning Theory (COLT),2021

4. Symmetry of Information from Meta-Complexity;baraniuk;Proceedings of the Computational Complexity Conference (CCC),2022

5. A Personal View of Average-Case Complexity;baraniuk;Proceedings of the Structure in Complexity Theory Conference,1995

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. One-Way Functions and Zero Knowledge;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Beating Brute Force for Compression Problems;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. コンピュテーション研究会近況報告;IEICE INFORMATION AND SYSTEMS SOCIETY JOURNAL;2024-05-01