Hard Sets Are Hard to Find-Reference-Cited by-同舟云学术

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

Hard Sets Are Hard to Find

Published:1999-10 Issue:2 Volume:59 Page:327-345
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Buhrman Harry,van Melkebeek Dieter

Publisher

Elsevier BV

Subject

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

Reference25 articles.

1. Measure on small complexity classes, with applications for BPP;Allender,1994

2. Separating NP-completeness notions under strong hypothesis;Ambos-Spies,1997

3. K. Ambos-Spies, S. Lempp, and, G. Mainhardt, Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets, manuscript, March 1998.

4. Genericity and measure for exponential time;Ambos-Spies;Theoret. Comput. Sci.,1996

5. BPP has subexponential time simulations unless EXPTIME has publishable proofs;Babai;Comput. Complexity,1993

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

1. Nonuniform Reductions and NP-Completeness;Theory of Computing Systems;2022-06-01

2. Generic density and small span theorem;Information and Computation;2008-01

3. Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets;Theory of Computing Systems;2007-07-04

4. Two Open Problems on Effective Dimension;Logical Approaches to Computational Barriers;2006

5. SIGACT news complexity theory column 48;ACM SIGACT News;2005-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP