带细胞分裂的组织P系统常见算法问题的统一解

Yunyun Niu, L. Pan, M. Pérez-Jiménez
{"title":"带细胞分裂的组织P系统常见算法问题的统一解","authors":"Yunyun Niu, L. Pan, M. Pérez-Jiménez","doi":"10.1109/BIC-TA.2011.43","DOIUrl":null,"url":null,"abstract":"Common algorithmic problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. A tissue P system with cell division is a computing model which has two basic characters: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. We here present an effective solution to the common algorithmic decision problem using a family of recognizer tissue P systems with cell division.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Uniform Solution to Common Algorithmic Problem by Tissue P Systems with Cell Division\",\"authors\":\"Yunyun Niu, L. Pan, M. Pérez-Jiménez\",\"doi\":\"10.1109/BIC-TA.2011.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Common algorithmic problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. A tissue P system with cell division is a computing model which has two basic characters: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. We here present an effective solution to the common algorithmic decision problem using a family of recognizer tissue P systems with cell division.\",\"PeriodicalId\":211822,\"journal\":{\"name\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIC-TA.2011.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIC-TA.2011.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

常见的算法问题是一个优化问题,它有一个很好的性质,就是其他几个np完全问题可以在线性时间内化为它。具有细胞分裂的组织P系统是具有细胞间通讯和细胞分裂能力两个基本特征的计算模型。细胞分裂的能力使我们能够在线性时间内获得指数数量的细胞,并在多项式时间内设计计算困难问题的细胞解决方案。我们在这里提出了一个有效的解决常见的算法决策问题,使用一个家族的识别组织P系统与细胞分裂。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Uniform Solution to Common Algorithmic Problem by Tissue P Systems with Cell Division
Common algorithmic problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. A tissue P system with cell division is a computing model which has two basic characters: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. We here present an effective solution to the common algorithmic decision problem using a family of recognizer tissue P systems with cell division.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信