Author:
Artemenko Sergei,Shaltiel Ronen
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference39 articles.
1. A. Akavia, O. Goldreich, S. Goldwasser & D. Moshkovitz (2006). On basing one-way functions on NP-hardness. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 701–710.
2. A. Atserias (2006). Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries. In IEEE Conference on Computational Complexity, 88–95.
3. Babai L., Fortnow L., Nisan N., Wigderson A. (1993) BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Computational Complexity 3: 307–318
4. A. Bogdanov & M. Safra (2007). Hardness Amplification for Errorless Heuristics. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 418–426.
5. Bogdanov A., Trevisan L. (2006) OnWorst-Case to Average-Case Reductions for NP Problems. SIAM J. Comput. 36(4): 1119–1159
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献