Solving the SAT problem by cell-like P systems with channel states and symport rules

DOI10.1155/2023/4993855zbMATH Open1545.6804MaRDI QIDQ6607641

Chuchuan Liu, Xiaoming Wan, Yueguo Luo

Publication date: 18 September 2024

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flat maximal parallelism in P systems with promoters
• Asynchronous P systems with active membranes
• The power of communication: P systems with symport/antiport
• P systems with minimal parallelism
• Computational complexity of tissue-like P systems
• Tissue P systems.
• Computing with membranes
• Real-life applications with membrane computing
• Tissue P systems with channel states
• Dendrite P systems
• A new method to simulate restricted variants of polarizationless P systems with active membranes
• Membrane computing models and robot controller design, current results and challenges
• Time-free cell-like P systems with multiple promoters/inhibitors
• Rule synchronization for tissue P systems
• Monodirectional tissue P systems with channel states
• Cell-like P systems with evolutional symport/antiport rules and membrane creation
• Alternative representations of P systems solutions to the graph colouring problem
• kNN-P: a kNN classifier optimized by P systems
• A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division
• An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Separation
• The computational power of timed P systems with active membranes using promoters
• Membrane Computing
• Supervisory control of discrete event systems under asynchronous spiking neuron P systems

Related Items (1)

Universal enzymatic numerical P systems with small number of enzymatic rules

This page was built for publication: Solving the SAT problem by cell-like P systems with channel states and symport rules