Is it possible to improve Yao’s XOR lemma using reductions that exploit the efficiency of their oracle?
Author:
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Link
https://link.springer.com/content/pdf/10.1007/s00037-023-00238-9.pdf
Reference34 articles.
1. Miklós Ajtai (1983). $$\sum^{1}$$1-Formulae on finite structures. Ann. Pure Appl. Log. 24(1), 1–48. URL https://doi.org/10.1016/0168-0072(83)90038-6.
2. Adi Akavia, Oded Goldreich, Shafi Goldwasser & Dana Moshkovitz (2006). On basing one-way functions on NP-hardness. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 701–710. URL https://doi.org/10.1145/1132516.1132614.
3. Benny Applebaum, Sergei Artemenko, Ronen Shaltiel & Guang Yang (2016). Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. Computational Complexity 25(2), 349–418. URL https://doi.org/10.1007/s00037-016-0128-9.
4. Sergei Artemenko & Ronen Shaltiel (2014). Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. Computational Complexity 23(1), 43–83. URL https://doi.org/10.1007/s00037-012-0056-2.
5. Albert Atserias (2006). Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries. In 21st Annual IEEE Conference on Computational Complexity, 88–95. URL https://doi.org/10.1109/CCC.2006.17.
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3