发布求助
文献互助 智能选刊 最新文献

complexity, logic, and recursion theory最新文献

筛选
英文 中文
Witness-Isomorphic Reductions and Local Search 见证-同构约简与局部搜索
complexity, logic, and recursion theory Pub Date : 1996-05-01 DOI: 10.1201/9780429187490-7
S. Fischer, L. Hemaspaandra, L. Torenvliet
{"title":"Witness-Isomorphic Reductions and Local Search","authors":"S. Fischer, L. Hemaspaandra, L. Torenvliet","doi":"10.1201/9780429187490-7","DOIUrl":"https://doi.org/10.1201/9780429187490-7","url":null,"abstract":"We study witness-isomorphic reductions, a type of structure-preserving reduction between NP decision problems. We completely determine the relative power of the different models of witness-isomorphic reduction, and we show that witness-isomorphic reductions can be used in a uniform approach to the local search problem.","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129705992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Compressibility of Infinite Binary Sequences 无限二进制序列的可压缩性
complexity, logic, and recursion theory Pub Date : 1996-02-06 DOI: 10.1201/9780429187490-3
José Luis Balcázar Navarro, Ricard Gavaldà Mestre, Montserrat Hermo Huguet
{"title":"Compressibility of Infinite Binary Sequences","authors":"José Luis Balcázar Navarro, Ricard Gavaldà Mestre, Montserrat Hermo Huguet","doi":"10.1201/9780429187490-3","DOIUrl":"https://doi.org/10.1201/9780429187490-3","url":null,"abstract":"It is known that infinite binary sequences of constant \u0000Kolmogorov complexity are exactly the recursive ones. \u0000Such a kind of statement no longer holds in the presence of resource bounds. \u0000Contrary to what intuition might suggest, there are sequences of \u0000constant, polynomial-time bounded Kolmogorov complexity that are \u0000not polynomial-time computable. This motivates the study of \u0000several resource-bounded variants in search for a characterization, \u0000similar in spirit, of the polynomial-time computable sequences. \u0000We propose some definitions, based on Kobayashi's notion of \u0000compressibility, and compare them to both the standard resource-bounded \u0000Kolmogorov complexity of infinite strings, and the uniform complexity. \u0000Some nontrivial coincidences and disagreements are proved. \u0000The resource-unbounded case is also considered.","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121024584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信