Author:
Bogdanov Andrej,Brzuska Christina
Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 701–710. ACM, New York (2006)
2. Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: Erratum for: On basing one-way functions on NP-hardness. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC 2010, pp. 795–796. ACM, New York (2010)
3. Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 59–68. ACM, New York (1986)
4. Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, October- 30 November 1, pp. 230–235. IEEE Computer Society (1989)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Planted Clique Conjectures Are Equivalent;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\);SIAM Journal on Computing;2023-12-15
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. On Worst-Case Learning in Relativized Heuristica;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02