Average-Case Computational Complexity Theory
Author:
Publisher
Springer New York
Link
http://link.springer.com/content/pdf/10.1007/978-1-4612-1872-2_12.pdf
Reference56 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Symposium on Foundations of Computer Science, pages 14–23, IEEE Computer Society Press, 1992.
2. J. Belanger and J. Wang. No NP problems averaging over ranking of distributions are harder. Theoretical Computer Science,in press.
3. J. Belanger and J. Wang. Isomorphisms of NP-complete problems on random instances. In Proceedings of the 8th Conference on Structure in Complexity Theory, pages 65–74, IEEE Computer Society Press, 1993.
4. J. Belanger and J. Wang. Rankable distributions do not provide harder instances than uniform distributions. In Proceedings of the 1st International Computing and Combinatorics Conference,pages 410–419, vol. 959 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995.
5. J. Belanger and J. Wang. Reductions and convergence rates of average time. In Proceedings of the 2nd International Computing and Combinatorics Conference, pages 300–309, vol. 1090 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996.
Cited by 21 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved Survey Propagation on Graphics Processing Units;Green, Pervasive, and Cloud Computing;2016
2. Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey;Annals of Mathematics and Artificial Intelligence;2013-06-08
3. TOWARDS POSSIBLE NON-EXTENSIVE THERMODYNAMICS OF ALGORITHMIC PROCESSING — STATISTICAL MECHANICS OF INSERTION SORT ALGORITHM;International Journal of Modern Physics C;2008-09
4. Guarantees for the success frequency of an algorithm for finding Dodgson-election winners;Journal of Heuristics;2007-12-28
5. Relations between Average-Case and Worst-Case Complexity;Theory of Computing Systems;2007-11-13
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3