An efficient time-free solution to SAT problem by P systems with proteins on membranes
From MaRDI portal
Publication:295645
DOI10.1016/J.JCSS.2016.03.008zbMATH Open1342.68133OpenAlexW2313379588MaRDI QIDQ295645FDOQ295645
Authors: Bosheng Song, Mario J. Pérez-Jiménez, Linqiang Pan 
Publication date: 13 June 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107940
Recommendations
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Time-free solution to SAT problem using P systems with active membranes
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Time-free solution to SAT problem by tissue P systems
- Computational efficiency and universality of timed P systems with active membranes
Cites Work
- Title not available (Why is that?)
- Computing with membranes
- Membrane computing. An introduction.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tissue P systems.
- Cell-like spiking neural P systems
- Spiking neural P systems
- The power of communication: P systems with symport/antiport
- Computational complexity of tissue-like P systems
- Tissue P systems with channel states
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Time-free solution to SAT problem using P systems with active membranes
- Tissue P Systems with Protein on Cells
- P Systems with Proteins on Membranes and Membrane Division
- P systems with proteins on membranes characterize PSPACE
- Computational efficiency and universality of timed P systems with active membranes
- Computational efficiency and universality of timed P systems with membrane creation
- Membrane Computing
- On the Computational Power of Flip-Flop Proteins on Membranes
- On Flip-Flop Membrane Systems with Proteins
- P systems with proteins on membranes
Cited In (14)
- Solving 3-SAT in distributed P systems with string objects
- Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
- Membrane Computing
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- A uniform solution to SAT using membrane creation
- A Solution of Horn-SAT with P Systems Using Antimatter
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
- Solving SAT with P systems with anti-membranes
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Tissue-like P systems with evolutional symport/antiport rules
- Time-freeness and clock-freeness and related concepts in P systems
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
- Time-free solution to SAT problem using P systems with active membranes
- The computational power of timed P systems with active membranes using promoters
This page was built for publication: An efficient time-free solution to SAT problem by P systems with proteins on membranes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295645)
