With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets-Reference-Cited by-同舟云学术

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

With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets

Published:1995-10 Issue:5 Volume:24 Page:1082-1090
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Fu Bin

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/S0097539792237188

Reference11 articles.

1. On Isomorphisms and Density of $NP$ and Other Complete Sets

2. On Sets Truth-Table Reducible to Sparse Sets

3. Lowness Properties of Sets in the Exponential-Time Hierarchy

4. Complete problems and strong polynomial reducibilities

5. On the computational complexity of algorithms

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

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

2. Dimension, Halfspaces, and the Density of Hard Sets;Theory of Computing Systems;2010-09-17

3. Separating NE from some nonuniform nondeterministic complexity classes;Journal of Combinatorial Optimization;2010-04-22

4. Online Learning and Resource‐Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets;SIAM Journal on Computing;2007-01

5. Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets;STACS 2006;2006

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP