Solving the SAT problem by cell-like P systems with channel states and symport rules
DOI10.1155/2023/4993855zbMATH Open1545.6804MaRDI QIDQ6607641FDOQ6607641
Authors: Xiaoming Wan, Chuchuan Liu, Yueguo Luo 
Publication date: 18 September 2024
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Recommendations
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
- P systems with evolutional symport and membrane creation rules solving QSAT
- Membrane creation and symport/antiport rules solving QSAT
- 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
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Computational aspects of satisfiability (68R07)
Cites Work
- Computing with membranes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tissue P systems.
- Flat maximal parallelism in P systems with promoters
- Spiking neural P systems
- The power of communication: P systems with symport/antiport
- P systems with minimal parallelism
- Computational complexity of tissue-like P systems
- Tissue P systems with channel states
- Membrane Computing
- An optimal frontier of the efficiency of tissue P systems with cell separation
- Asynchronous P systems with active membranes
- A new method to simulate restricted variants of polarizationless P systems with active membranes
- Cell-like P systems with evolutional symport/antiport rules and membrane creation
- Rule synchronization for tissue P systems
- Real-life applications with membrane computing
- Monodirectional tissue P systems with channel states
- The computational power of timed P systems with active membranes using promoters
- Dendrite P systems
- Membrane computing models and robot controller design, current results and challenges
- Time-free cell-like P systems with multiple promoters/inhibitors
- A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
- Alternative representations of P systems solutions to the graph colouring problem
- kNN-P: a kNN classifier optimized by P systems
- Supervisory control of discrete event systems under asynchronous spiking neuron P systems
Cited In (1)
This page was built for publication: Solving the SAT problem by cell-like P systems with channel states and symport rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607641)
