On the relative complexity of hard problems for complexity classes without complete problems-Reference-Cited by-同舟云学术

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

On the relative complexity of hard problems for complexity classes without complete problems

Published:1989-01 Issue:1 Volume:63 Page:43-61
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Ambos-Spies Klaus

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference22 articles.

1. Two theorems on random polynomial time;Adleman;Proc. 19th IEEE Symp. on Foundations of Computer Science,1978

2. Sublattices of the polynomial time degrees;Ambos-Spies;Inform. and Control,1985

3. A note on complete problems for complexity classes;Ambos-Spies;Inform. Process. Lett.,1986

4. Polynomial time degrees of NP-sets;Ambos-Spies,1987

5. Minimal pairs for polynomial time reducibilities;Ambos-Spies,1987

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

1. Computational Complexity;Computational Logic;2014

2. A Computational Framework for the Study of Partition Functions and Graph Polynomials;Proceedings of the 12th Asian Logic Conference;2013-05-28

3. Computability and Complexity Theory;Texts in Computer Science;2011

4. Hyper-polynomial hierarchies and the polynomial jump;Theoretical Computer Science;2001-07

5. Polynomial Time Reducibilities and Degrees;Handbook of Computability Theory;1999

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP