The quantitative structure of exponential time

J. H. Lutz
{"title":"The quantitative structure of exponential time","authors":"J. H. Lutz","doi":"10.1109/SCT.1993.336530","DOIUrl":null,"url":null,"abstract":"Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E=DTIME(2/sup linear/) and E/sub 2/=DTIME(2/sup polynomial/) are surveyed. The measure structure of these classes is seen to interact in informative ways with bi-immunity, complexity cores, /sub <or=/m/sup P/-reducibility, circuit-size complexity, Kolmogorov complexity, and the density of hard languages. Possible implications for the structure of NP are discussed.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"150","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1993.336530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 150

Abstract

Recent results on the internal, measure-theoretic structure of the exponential time complexity classes E=DTIME(2/sup linear/) and E/sub 2/=DTIME(2/sup polynomial/) are surveyed. The measure structure of these classes is seen to interact in informative ways with bi-immunity, complexity cores, /sub >
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
指数时间的定量结构
综述了指数时间复杂度类E=DTIME(2/sup线性/)和E/ sub2 /=DTIME(2/sup多项式/)的内部测量理论结构的最新研究成果。这些类的度量结构以信息方式与双免疫、复杂性核心、/sub >相互作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles On oracle builder's toolkit The quantitative structure of exponential time On span programs NP-complete problems have a version that's hard to approximate
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1