Time-free solution to SAT problem using P systems with active membranes
Authors:
- Tao SongTSTao Song
- Luis F. Macías-RamosLMLuis F. Macías-Ramos
- Linqiang PanLinqiang Pan
- Mario J. Pérez-JiménezMPMario J. Pérez-Jiménez
- 1 April 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 529, 61-68
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (61033003, 61100145, 61272071, 61320106005, 91130034)
- Ministry of Education of the People's Republic of China (20100142110072, 2012014213008)
- Natural Science Foundation of Hubei Province (2011CDA027)
This publication has 13 references indexed in Scilit:
- COMPUTATION OF RAMSEY NUMBERS BY P SYSTEMS WITH ACTIVE MEMBRANESInternational Journal of Foundations of Computer Science, 2011
- Small universal spiking neural P systemsBioSystems, 2007
- Computational efficiency of dissolution rules in membrane systemsInternational Journal of Computer Mathematics, 2006
- Further remark on P systems with active membranes and two polarizationsJournal of Parallel and Distributed Computing, 2006
- Solving multidimensional 0–1 knapsack problem by P systems with input and active membranesJournal of Parallel and Distributed Computing, 2005
- Trading polarizations for labels in P systems with active membranesActa Informatica, 2004
- On the power of membrane division in P systemsTheoretical Computer Science, 2004
- Tissue P systemsTheoretical Computer Science, 2003
- On P Systems with Active Membranes2001
- Computing with MembranesJournal of Computer and System Sciences, 2000