NP-P中的稀疏集:EXPTIME与NEXPTIME

Q4 Mathematics
J. Hartmanis, N. Immerman, V. Sewelson
{"title":"NP-P中的稀疏集:EXPTIME与NEXPTIME","authors":"J. Hartmanis,&nbsp;N. Immerman,&nbsp;V. Sewelson","doi":"10.1016/S0019-9958(85)80004-8","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates the structural properties of sets in <em>NP-P</em> and shows that the computational difficulty of lower density sets in <em>NP</em> depends explicitly on the relations between higher deterministic and nondeterministic time-bounded complexity classes. The paper exploits the recently discovered <em>upward separation</em> method, which shows for example that there exist sparse sets in <em>NP-P</em> if and only if <em>EXPTIME ≠ NEXPTIME</em>. In addition, the paper uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and exhibits one of the first natural structural differences between relativized <em>NP</em> and <em>CoNP</em>.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 158-181"},"PeriodicalIF":0.0000,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80004-8","citationCount":"0","resultStr":"{\"title\":\"Sparse sets in NP-P: EXPTIME versus NEXPTIME\",\"authors\":\"J. Hartmanis,&nbsp;N. Immerman,&nbsp;V. Sewelson\",\"doi\":\"10.1016/S0019-9958(85)80004-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper investigates the structural properties of sets in <em>NP-P</em> and shows that the computational difficulty of lower density sets in <em>NP</em> depends explicitly on the relations between higher deterministic and nondeterministic time-bounded complexity classes. The paper exploits the recently discovered <em>upward separation</em> method, which shows for example that there exist sparse sets in <em>NP-P</em> if and only if <em>EXPTIME ≠ NEXPTIME</em>. In addition, the paper uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and exhibits one of the first natural structural differences between relativized <em>NP</em> and <em>CoNP</em>.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"65 2\",\"pages\":\"Pages 158-181\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80004-8\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800048\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了NP- p中集合的结构性质,并证明了NP中低密度集合的计算难度明显依赖于高确定性和非确定性有界复杂度类之间的关系。本文利用最近发现的向上分离方法,例如证明了NP-P中存在稀疏集当且仅当EXPTIME≠NEXPTIME。此外,本文使用相对化技术来确定逻辑可能性,这些证明技术的局限性,并展示了相对化NP和CoNP之间的第一个自然结构差异之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sparse sets in NP-P: EXPTIME versus NEXPTIME

This paper investigates the structural properties of sets in NP-P and shows that the computational difficulty of lower density sets in NP depends explicitly on the relations between higher deterministic and nondeterministic time-bounded complexity classes. The paper exploits the recently discovered upward separation method, which shows for example that there exist sparse sets in NP-P if and only if EXPTIME ≠ NEXPTIME. In addition, the paper uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and exhibits one of the first natural structural differences between relativized NP and CoNP.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信