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

Hardness vs randomness

  • Published:1994-10 Issue:2 Volume:49 Page:149-167
  • ISSN:0022-0000
  • Container-title:Journal of Computer and System Sciences
  • language:en
  • Short-container-title:Journal of Computer and System Sciences

Author:

Nisan Noam,Wigderson Avi

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference25 articles.

1. Deterministic simulation of Probabilistic constant depth circuits;Ajtai,1985

2. Trading group theory for randomness;Babai,1975

3. Relative to a random oracle A, PA≠NPA≠Co − NAA with probability 1;Bennet;SIAM J. Comput.,1981

4. Arthur Merlin games: A randomized proof system, and a hierarchy of complexity classes;Babai;J. Comput. System Sci.,1988

5. BPP has weak subesponential simulations unless EXPTIME has publishable proofs;Babai,1991

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

1. Hitting Sets for Orbits of Circuit Classes and Polynomial Families;ACM Transactions on Computation Theory;2024-09-10

2. Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Explicit Codes for Poly-Size Circuits and Functions That Are Hard to Sample on Low Entropy Distributions;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Symmetric Exponential Time Requires Near-Maximum Circuit Size: Simplified, Truly Uniform;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Symmetric Exponential Time Requires Near-Maximum Circuit Size;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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