On the theory of average case complexity-Reference-Cited by-同舟云学术

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

On the theory of average case complexity

Published:1992-04 Issue:2 Volume:44 Page:193-219
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Ben-David Shai,Chor Benny,Goldreich Oded,Luby Michel

Publisher

Elsevier BV

Subject

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

Reference29 articles.

1. Universal classes of hash functions;Carter;Comput. System Sc. J.,1979

2. The complexity of theorem proving procedures;Cook,1971

3. A Completeness Theorem for Almost Everywhere Invulnerable Generators;Feigenbaum,1989

4. Computers and Intractability: A guide to the Theory of NP-completeness;Garey,1979

5. Towards a Theory of Average Case Complexity (A Survey);Goldreich,1988

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

1. Quantifying Grover speed-ups beyond asymptotic analysis;Quantum;2023-10-10

2. Worst-case to average-case reductions via additive combinatorics;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Average-case hardness of NP from exponential worst-case hardness assumptions;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

4. Guest Column;ACM SIGACT News;2021-03-16

5. Is it Easier to Prove Theorems that are Guaranteed to be True?;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP