Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables

2014 ◽  
pp. 189-205 ◽  
Author(s):  
Zsolt Gazdag
Keyword(s):  
Linear Time ◽  
P Systems ◽  
Active Membranes

scholarly journals Bio-inspired Membrane Operations in P Systems with Active Membranes

Triangle ◽  
2018 ◽  
pp. 19
Author(s):  
Artiom Alhazov ◽  
Tseren-Onolt Ishdorj
Keyword(s):  
General Class ◽  
Membrane Structure ◽  
Membrane Separation ◽  
Linear Time ◽  
P Systems ◽  
Sat Problem ◽  
Separation Membrane ◽  
Active Membranes

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.

Semi-Uniform Solution for Common Algorithmic Problem by P System in the Minimally Parallel Mode

2014 ◽  
Vol 568-570 ◽  
pp. 802-806
Author(s):  
Yun Yun Niu ◽  
Zhi Gao Wang
Keyword(s):  
Linear Time ◽  
P Systems ◽  
P System ◽  
Algorithmic Problem ◽  
Complete Problems ◽  
Active Membranes ◽  
Uniform Solution ◽  
Parallel Mode ◽  
The Common ◽  
Np Complete

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.

A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time

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

scholarly journals An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

2010 ◽  
pp. 461-478 ◽  
Author(s):  
Andrea Valsecchi ◽  
Antonio E. Porreca ◽  
Alberto Leporati ◽  
Giancarlo Mauri ◽  
Claudio Zandron
Keyword(s):  
P Systems ◽  
Polynomial Space ◽  
Turing Machines ◽  
Efficient Simulation ◽  
Active Membranes

P Systems with Active Membranes, Without Polarizations and Without Dissolution: A Characterization of P

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

Simulation of P Systems with Active Membranes on CUDA

2009 ◽  
Author(s):  
José María Cecilia Canales ◽  
José Manuel García Carrasco ◽  
Ginés David Guerrero Hernandez ◽  
Miguel Ángel Martínez del Amor ◽  
Ignacio Pérez Hurtado de Mendoza ◽  
...  
Keyword(s):  
P Systems ◽  
Active Membranes

scholarly journals COMPUTATION OF RAMSEY NUMBERS BY P SYSTEMS WITH ACTIVE MEMBRANES

2011 ◽  
Vol 22 (01) ◽  
pp. 29-38 ◽  
Author(s):  
LINQIANG PAN ◽  
DANIEL DÍAZ-PERNIL ◽  
MARIO J. PÉREZ-JIMÉNEZ
Keyword(s):  
Membrane Computing ◽  
P Systems ◽  
Ramsey Number ◽  
Ramsey Numbers ◽  
Combinatorial Object ◽  
Active Membranes ◽  
Number Problem ◽  
Decision Version

Ramsey numbers deal with conditions when a combinatorial object necessarily contains some smaller given objects. It is well known that it is very difficult to obtain the values of Ramsey numbers. In this work, a theoretical chemical/biological solution is presented in terms of membrane computing for the decision version of Ramsey number problem, that is, to decide whether an integer n is the value of Ramsey number R(k, l), where k and l are integers.

Sign in / Sign up

Export Citation Format

Share Document