Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
From MaRDI portal
Publication:766179
DOI10.1007/S00236-011-0144-9zbMath1234.68124OpenAlexW2116584032WikidataQ57936758 ScholiaQ57936758MaRDI QIDQ766179
Publication date: 23 March 2012
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-011-0144-9
Related Items (6)
Solving SAT with P systems with anti-membranes ⋮ The power of synchronizing rules in membrane computing ⋮ On the efficiency of synchronized P systems ⋮ Synchronization of rules in membrane computing ⋮ Efficiently solving the bin packing problem through bio-inspired mobility ⋮ Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
Cites Work
- Unnamed Item
- Unnamed Item
- Enhanced mobile membranes: computability results
- Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
- P systems with mobile membranes
- Solving HPP and SAT by P systems with active membranes and separation rules
- Turing Completeness Using Three Mobile Membranes
- Simple, Enhanced and Mutual Mobile Membranes
- A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes
This page was built for publication: Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
