Ordinal Hierarchies and Naming Complexity Classes-Reference-Cited by-同舟云学术

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

Ordinal Hierarchies and Naming Complexity Classes

Published:1973-10 Issue:4 Volume:20 Page:668-686
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Bass Leonard¹,Young Paul²

Affiliation:

1. Computer Science and Experimental Statistics Department, University of Rhode Island, Kingston, Rhode Island

2. Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA and Purdue University, Lafayette, Indiana

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference35 articles.

1. On a subrecursive hierarchy and primitive recursive degrees;AXT P;Trans. Amer. Math. Soc.,1959

2. A Machine-Independent Theory of the Complexity of Recursive Functions

3. Computational Complexity and the Existence of Complexity Gaps

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

1. The intrinsic difficulty of recursive functions;Studia Logica;1996-05

2. Bibliography;Computability, Complexity, Logic;1989

3. Diversity of Speed-Ups and Embeddability in Computational Complexity;The Journal of Symbolic Logic;1976-03

4. Diversity of speed-ups and embeddability in computational complexity;Journal of Symbolic Logic;1976-03

5. The non-renameability of honesty classes;Computing;1975-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP