Skip to main content
SpringerLink
Log in

Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Mutual mobile membrane systems represent a variant of mobile membrane systems in which endocytosis and exocytosis work whenever the involved membranes “agree” on the movement by using mutual complement objects placed in membranes. We provide a semi-uniform polynomial solution for a weak NP-complete problem (namely partition problem) by means of mutual mobile membrane systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aman B., Ciobanu G.: Turing completeness using three mobile membranes. Lect. Notes Comput. Sci. 5715, 42–55 (2009)

    Article  MathSciNet  Google Scholar 

  2. Aman B., Ciobanu G.: Simple, enhanced and mutual mobile membranes. Trans. Comput. Syst. Biol. XI, 26–44 (2009)

    Google Scholar 

  3. Aman, B., Ciobanu, G.: Solving weak NP-complete problems in polynomial time with mutual mobile membrane systems. Technical Report FML-11-02, ISSN 1842-1490. http://iit.iit.tuiasi.ro (2011)

  4. Ciobanu G., Krishna S.N.: Enhanced mobile membranes: computability results. Theory Comput. Syst. 48(3), 715–729 (2011). doi:10.1007/s00224-010-9256-9

    Article  MathSciNet  MATH  Google Scholar 

  5. Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds): Applications of Membrane Computing. Springer, Berlin (2006)

    Google Scholar 

  6. Garey M., Johnson D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  7. Krishna S.N., Ciobanu G.: A \({\Sigma_2^P \cup \Pi_2^P}\) lower bound using mobile membranes. Lect. Notes Comput. Sci. 6808, 275–288 (2011)

    Article  Google Scholar 

  8. Krishna S.N., Păun G.: P systems with mobile membranes. Nat. Comput. 4, 255–274 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Pan L., Alhazov A.: Solving HPP and SAT by P systems with active membranes and separation rules. Acta Inf. 43(2), 131–145 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Păun G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  11. Păun, G., Rozenberg, G., Salomaa, A. (eds): The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford (2010)

    MATH  Google Scholar 

  12. Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity-Membrane Division, Membrane Creation. In [11], pp. 302–336

Download references

Author information

Authors and Affiliations

  1. Romanian Academy, Institute of Computer Science, Iaşi, Romania

    Bogdan Aman & Gabriel Ciobanu

  2. “A.I.Cuza” University, Blvd. Carol I no.11, 700506, Iaşi, Romania

    Bogdan Aman & Gabriel Ciobanu

Authors
  1. Bogdan Aman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriel Ciobanu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriel Ciobanu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aman, B., Ciobanu, G. Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems. Acta Informatica 48, 409–415 (2011). https://doi.org/10.1007/s00236-011-0144-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-011-0144-9

Keywords

Search

Navigation