Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

Published:2011 Issue: Volume: Page:377-388
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Artemenko Sergei,Shaltiel Ronen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22935-0_32

Reference39 articles.

1. Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on np-hardness. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 701–710 (2006)

2. Atserias, A.: Distinguishing sat from polynomial-size circuits, through black-box queries. In: IEEE Conference on Computational Complexity, pp. 88–95 (2006)

3. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: Bpp has subexponential time simulations unless exptime has publishable proofs. Computational Complexity 3, 307–318 (1993)

4. Bogdanov, A., Safra, M.: Hardness amplification for errorless heuristics. In: 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 418–426 (2007)

5. Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for np problems. SIAM J. Comput. 36(4), 1119–1159 (2006)

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

1. Pseudorandomness from Shrinkage;Journal of the ACM;2019-04-26

2. On the Complexity of Simulating Auxiliary Input;Advances in Cryptology – EUROCRYPT 2018;2018

3. Query Complexity in Errorless Hardness Amplification;computational complexity;2015-10-29

4. Advice Lower Bounds for the Dense Model Theorem;ACM Transactions on Computation Theory;2015-01-13

5. Pseudorandomness from Shrinkage;2012 IEEE 53rd Annual Symposium on Foundations of Computer Science;2012-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3