The complexity of the max word problem
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/BFb0020820
Reference10 articles.
1. J.-P. Allouche and J. Shallit, The Ring of k-regular Sequences, Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag Lecture Notes in Computer Science, Number 415 February 1990, pp 12–23.
2. A. Condon, Space Bounded Probabilistic Game Automata, Proceedings of the Third Annual conference on Structure in Complexity Theory, June 1988, pp 162–174. To appear in the Journal of the Association for Computing Machinery.
3. A. Condon and R. J. Lipton, Upper Bounds on the Complexity of Space Bounded Interactive Proofs, Technical Report 841, Computer Sciences Department, University of Wisconsin-Madison, April 1989.
4. J. Gill, Computational Complexity of Probabilistic Turing Machines, SIAM Journal on Computing, 6, No. 4, 1977, pps 675–695.
5. S. Goldwasser, S. Micali and C. Rackoff, The knowledge complexity of interactive proof systems, Proceedings of 17th Symposium of the Theory of Computing (STOC), 1985, pp 291–304.
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;North-Holland Mathematics Studies;2004
2. Fixed-Parameter Tractability and Completeness I: Basic Results;SIAM Journal on Computing;1995-08
3. Logspace verifiers, NC, and NP;Algorithms and Computations;1995
4. The complexity of the max word problem and the power of one-way interactive proof systems;Computational Complexity;1993-09
5. Probabilistic Verification and Non-Approximability;Handbook of Combinatorial Optimization
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3