A note on some simultaneous relations among time, space, and reversal for single work tape nondeterministic turing machines

Q4 Mathematics 信息与控制 Pub Date : 1986-08-01 DOI:10.1016/S0019-9958(86)80003-1
Etsuro Moriya, Shigeki Iwata, Takumi Kasai
{"title":"A note on some simultaneous relations among time, space, and reversal for single work tape nondeterministic turing machines","authors":"Etsuro Moriya,&nbsp;Shigeki Iwata,&nbsp;Takumi Kasai","doi":"10.1016/S0019-9958(86)80003-1","DOIUrl":null,"url":null,"abstract":"<div><p>Simultaneous resource bounded complexity classes for nondeterministic single worktape off-line Turing machines are considered such as time-space bounded classes, denoted by NTISP<sub>1</sub>(<em>T, S</em>), reversal-space bounded classes, denoted by NRESP<sub>1</sub>(<em>R, S</em>), and time-reversal bounded classes, denoted by NTIRE<sub>1</sub>(<em>T, R</em>). It is shown that NRESP<sub>1</sub>(<em>R</em>(<em>n</em>), <em>S</em>(<em>n</em>)) contains NTISP<sub>1</sub>(<em>S</em>(<em>n</em>), <em>R</em>(<em>n</em>)) and is contained in NTISP<sub>1</sub>(<em>R</em>(<em>n</em>) <em>S</em>(<em>n</em>)<em>n</em><sup>2</sup> log <em>n</em>, <em>R</em>(<em>n</em>) log <em>n</em>). The following corollaries follow: (1) the affirmative solution to the nondeterministic single worktape version of the <em>NC</em> = ? <em>SC</em> problem, NTIRE<sub>1</sub>(poly, polylog) = NTISP<sub>1</sub>(poly, polylog), and (2) a reversal-space trade-off, NRESP<sub>1</sub>(polylog, poly) = NRESP<sub>1</sub>(poly, polylog).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1986-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80003-1","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3

Abstract

Simultaneous resource bounded complexity classes for nondeterministic single worktape off-line Turing machines are considered such as time-space bounded classes, denoted by NTISP1(T, S), reversal-space bounded classes, denoted by NRESP1(R, S), and time-reversal bounded classes, denoted by NTIRE1(T, R). It is shown that NRESP1(R(n), S(n)) contains NTISP1(S(n), R(n)) and is contained in NTISP1(R(n) S(n)n2 log n, R(n) log n). The following corollaries follow: (1) the affirmative solution to the nondeterministic single worktape version of the NC = ? SC problem, NTIRE1(poly, polylog) = NTISP1(poly, polylog), and (2) a reversal-space trade-off, NRESP1(polylog, poly) = NRESP1(poly, polylog).

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
单工作带不确定性图灵机的时间、空间和反转的同时关系
考虑不确定性单磁带离线图灵机的同时资源有界复杂性类,如时空有界类,记为NTISP1(T, S),逆空间有界类,记为NRESP1(R, S),时间反转有界类,记为NTIRE1(T, R)。由图可知,NRESP1(R(n), S(n))包含NTISP1(S(n), R(n) log n),并包含在NTISP1(R(n) S(n)n2 log n, R(n) log n)中,得到以下推论:(1)非确定性单工作带版本NC = ?SC问题,NTIRE1(poly, polylog) = NTISP1(poly, polylog),和(2)一个反向空间权衡,NRESP1(polylog, poly) = NRESP1(poly, polylog)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
期刊最新文献
Systolic trellis automata: Stability, decidability and complexity On relativized exponential and probabilistic complexity classes A note on succinct representations of graphs Function definitions in term rewriting and applicative programming Simulation of large networks on smaller networks
×
引用
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