Splitting NP-complete sets infinitely

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Liyu Zhang, Mahmoud Quweider, Fitra Khan, Hansheng Lei
{"title":"Splitting NP-complete sets infinitely","authors":"Liyu Zhang,&nbsp;Mahmoud Quweider,&nbsp;Fitra Khan,&nbsp;Hansheng Lei","doi":"10.1016/j.ipl.2024.106472","DOIUrl":null,"url":null,"abstract":"<div><p>Glaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language <em>L</em> can be split into two NP-complete languages <span><math><mi>L</mi><mo>∩</mo><mi>S</mi></math></span> and <span><math><mi>L</mi><mo>∩</mo><mover><mrow><mi>S</mi></mrow><mo>‾</mo></mover></math></span>, where <em>S</em> is a language in P. It follows that every NP-complete language can be partitioned into an arbitrary <em>finite</em> number of NP-complete languages. We strengthen and generalize this result by showing that every NP-complete language can be partitioned into <em>infinitely</em> many NP-complete languages. Furthermore those NP-complete languages resulting from such partitioning can be <em>effectively presented</em>.</p></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"186 ","pages":"Article 106472"},"PeriodicalIF":0.7000,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019024000024","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Glaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language L can be split into two NP-complete languages LS and LS, where S is a language in P. It follows that every NP-complete language can be partitioned into an arbitrary finite number of NP-complete languages. We strengthen and generalize this result by showing that every NP-complete language can be partitioned into infinitely many NP-complete languages. Furthermore those NP-complete languages resulting from such partitioning can be effectively presented.

无限分割 NP-完全集合
Glaßer 等人(SIAMJCOMP 2009 和 TCS 2009)证明了 NP-完全语言在多-一还原时是多项式时间有丝分裂的,这意味着每种 NP-完全语言 L 都可以分割成两种 NP-完全语言 L∩S 和 L∩S‾,其中 S 是 P 中的一种语言。我们通过证明每一种 NP-完全语言都可以被划分为无限多的 NP-完全语言来加强和推广这一结果。此外,这种分割所产生的 NP-完全语言可以有效地呈现出来。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Processing Letters
Information Processing Letters 工程技术-计算机:信息系统
CiteScore
1.80
自引率
0.00%
发文量
70
审稿时长
7.3 months
期刊介绍: Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.
×
引用
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学术官方微信