Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
From MaRDI portal
Publication:1982964
DOI10.1007/S41965-020-00040-4zbMath1469.68026OpenAlexW3030964345MaRDI QIDQ1982964
Henry N. Adorna, Kelvin C. Buño
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-020-00040-4
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Communication complexity, information complexity (68Q11)
Related Items (6)
On the power of P systems with active membranes using weak non-elementary membrane division ⋮ Solving SAT with P systems with anti-membranes ⋮ Solving 3-SAT in distributed P systems with string objects ⋮ Evaluating space measures in P systems ⋮ Alternative space definitions for P systems with active membranes ⋮ Proof techniques in membrane computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient time-free solution to SAT problem by P systems with proteins on membranes
- A uniform solution to SAT using membrane creation
- Computing with membranes
- Solving the N-queens problem using dP systems with active membranes
- Membrane computing. An introduction.
- A survey of results on evolution-communication P systems with energy
- Tissue-like P systems with evolutional symport/antiport rules
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- P systems attacking hard problems beyond NP: a survey
- Time-free solution to SAT problem using P systems with active membranes
- A New Approach for Solving SAT by P Systems with Active Membranes
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
This page was built for publication: Distributed computation of a \(k\) P systems with active membranes for SAT using clause completion
