Degree Bounds on Polynomials and Relativization Theory
Author:
Publisher
Kluwer Academic Publishers
Link
http://link.springer.com/content/pdf/10.1007/1-4020-8141-3_10.pdf
Reference36 articles.
1. N. Alon and R. Beigel. Lower bounds for approximations by low degree polynomials over Z m In Proceedings of the 16th Annual IEEE Conference on Computational Complexity, pages 184–187, Los Alamitos, CA, June 18–21 2000. IEEE Computer Society.
2. V. Arvind and P. Kurur. Graph isomorphism is in SPP. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 743–750, Los Alamitos, November 16–19 2002. IEEE Computer Society.
3. K. Ambos-Spies. A note on complete problems for complexity classes. Information Processing Letters, 23(5):227–230, 1986.
4. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48, 2001.
5. R. Beigel, H. Buhrman, and L. Fortnow. NP might not be as easy as detecting unique solutions. In Proceedings of the 30th ACM Symposium on Theory of Computing, pages 203–208. ACM Press, May 1998.
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3