A Linear-Time Solution to the Knapsack Problem Using P Systems with Active Membranes

Author(s):  
Mario J. Pérez-Jiménez ◽  
Agustin Riscos-Núñez
Triangle ◽  
2018 ◽  
pp. 19
Author(s):  
Artiom Alhazov ◽  
Tseren-Onolt Ishdorj

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.


2014 ◽  
Vol 568-570 ◽  
pp. 802-806
Author(s):  
Yun Yun Niu ◽  
Zhi Gao Wang

It is known that the Common Algorithmic Problem (CAP) has a nice property that several other NP-complete problems can be reduced to it in linear time. In the literature, the decision version of this problem can be efficiently solved with a family of recognizer P systems with active membranes with three electrical charges working in the maximally parallel way. We here work with a variant of P systems with active membranes that do not use polarizations and present a semi-uniform solution to CAP in the minimally parallel mode.


2011 ◽  
Vol 2 (3) ◽  
pp. 49-60 ◽  
Author(s):  
Xingyi Zhang ◽  
Yunyun Niu ◽  
Linqiang Pan ◽  
Mario J. Pérez-Jiménez

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P systems with cell division, a linear-time solution to prime factorization problem is given on biochemical computational devices – tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.


Author(s):  
Xingyi Zhang ◽  
Yunyun Niu ◽  
Linqiang Pan ◽  
Mario J. Pérez-Jiménez

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P systems with cell division, a linear-time solution to prime factorization problem is given on biochemical computational devices – tissue P systems with cell division, instead of computational devices based on the laws of quantum physical.


2016 ◽  
Vol 17 (2) ◽  
pp. 311-319 ◽  
Author(s):  
A. Hepzibah Christinal ◽  
Daniel Díaz-Pernil ◽  
T. Mathu
Keyword(s):  

2018 ◽  
Vol 27 (2) ◽  
pp. 367-373 ◽  
Author(s):  
Ping GUO ◽  
Jian ZHU ◽  
Haizhu CHEN ◽  
Ruilong YANG

Author(s):  
Andrea Valsecchi ◽  
Antonio E. Porreca ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Claudio Zandron

Author(s):  
Miguel A. Gutiérrez-Naranjo ◽  
Mario J. Pérez-Jiménez ◽  
Agustín Riscos-Núñez ◽  
Francisco J. Romero-Campero
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document