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.68124WikidataQ57936758 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
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
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, Synchronization of rules in membrane computing
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