A uniform solution to SAT using membrane creation-Reference-Cited by-同舟云学术

A uniform solution to SAT using membrane creation

Published:2007-02 Issue:1-2 Volume:371 Page:54-61
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gutiérrez-Naranjo Miguel A.,Pérez-Jiménez Mario J.,Romero-Campero Francisco J.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Towards a programming language in cellular computing;Gutiérrez-Naranjo;Electronic Notes in Theoretical Computer Science,2005

2. A fast P system for finding a balanced 2-partition;Gutiérrez-Naranjo;Soft Computing,2005

3. Characterizing tractability with membrane creation;Gutiérrez-Naranjo,2005

4. M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, F.J. Romero-Campero, A linear time solution for QSAT with membrane creation, in: R. Freund, G. Lojka, M. Oswald, Gh. Paun (Eds.), Pre-Proceedings of the Sixth International Workshop on Membrane Computing, WMC6, Vienna University of Technology, Vienna, Austria, 2005, pp. 395–409

5. The chemical implementation of autopoiesis;Luisi,1994

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving the SAT problem with the string multiset rewriting calculus;Computing;2024-02-06

2. Solving the SAT problem using spiking neural P systems with coloured spikes and division rules;2024-01-15

3. Lattice Based Communication P Systems;Journal of Advanced Computational Intelligence and Intelligent Informatics;2023-11-20

4. Solving 3-SAT in distributed P systems with string objects;Theoretical Computer Science;2023-07

5. Solving SAT with P systems with anti-membranes;Journal of Membrane Computing;2023-04-24