Almost-everywhere complexity hierarchies for nondeterministic time-Reference-Cited by-同舟云学术

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

Almost-everywhere complexity hierarchies for nondeterministic time

Published:1993-07 Issue:2 Volume:115 Page:225-241
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Allender Eric,Beigel Richard,Hertrampf Ulrich,Homer Steven

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference27 articles.

1. Oracles vs. Proof techniques that do not relativize;Allender,1990

2. A note on the almost-everywhere hierarchy for nondeterministic time;Allender,1990

3. Non-deterministic exponential time has two-prover interactive protocols;Babai;Proc. 31st IEEE Symp. on Foundations of Computer Science,1990

4. Bi-immune sets for complexity classes;Balcázar;Math. Systems Theory,1985

5. Time- and tape-bounded Turing acceptors and AFL's;Book;J. Comput. System Sci.,1970

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

1. A parameterized halting problem, the linear time hierarchy, and the MRDP theorem;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

2. On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity;Fundamenta Informaticae;2017-05-10

3. New Non-Uniform Lower Bounds for Uniform Classes;LEIBNIZ INT PR INFOR;2016

4. A Turing Machine Distance Hierarchy;Language and Automata Theory and Applications;2013

5. NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets;LATIN 2012: Theoretical Informatics;2012

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP