The Fault Tolerance of NP-Hard Problems-Reference-Cited by-同舟云学术

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

The Fault Tolerance of NP-Hard Problems

Published:2009 Issue: Volume: Page:374-385
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Glaßer Christian,Pavan A.,Travers Stephen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00982-2_32

Reference12 articles.

1. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47(3), 549–595 (1993)

2. Yesha, Y.: On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. SIAM Journal on Computing 12(3), 411–425 (1983)

3. Ogiwara, M.: On P-closeness of polynomial-time hard sets (manuscript, 1991)

4. Fu, B.: On lower bounds of the closeness between complexity classes. Mathematical Systems Theory 26(2), 187–202 (1993)

5. Ladner, R.E., Lynch, N.A., Selman, A.L.: A comparison of polynomial time reducibilities. Theoretical Computer Science 1, 103–123 (1975)

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

1. Dynamic ACO-based Fault Tolerance in Grid Computing;International Journal of Grid and Distributed Computing;2017-12-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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