A thirty Year old conjecture about promise problems-Reference-Cited by-同舟云学术

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

A thirty Year old conjecture about promise problems

Published:2015-09-17 Issue:4 Volume:25 Page:883-919
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Hughes Andrew,Mandal Debasis,Pavan A.,Russell Nathan,Selman Alan L.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-015-0107-6.pdf

Reference29 articles.

1. L. Adleman & K. Manders (1977). Reducibility, randomness, and intractability. In Proceedings of the 9th ACM Symposium on Theory of Computing, 151–163

2. M. Agrawal (2002). Pseudo-random Generators and Structure of Complete Degrees. In 17th Annual IEEE Conference on Computational Complexity, 139–147

3. M. Agrawal & O. Watanabe (2009). One-Way Functions and the Berman-Hartmanis Conjecture. In Proceedings of the 24th IEEE Conference on Computational Complexity, 194–202

4. M. Ajtai & C. Dwork (1997). A public-key cryptosystem with worstcase/average-case equivalence. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, 284–293

5. Ambos-Spies K., Bentzien L. (2000) Separating NP-completeness under strong hypotheses. Journal of Computer and System Sciences 61(3): 335–361

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

1. SIGACT News Complexity Theory Column 108;ACM SIGACT News;2021-03-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP