Skip to main content
SpringerLink
Log in

A \(\Sigma_2^P \cup \Pi_2^P\) Lower Bound Using Mobile Membranes

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6808))

Included in the following conference series:

Abstract

One of the interesting applications of membrane computing is the ability to solve intractable problems in polynomial time. The existing variants with active membranes have several powerful features like polarizations, dissolution, evolution and communication rules as well as non-elementary membrane division. We propose a simple variant which uses elementary membrane division and communication only in the form of mobility of membranes. We show that this variant has \(\Sigma_2^P \cup \Pi_2^P\) as lower bound. This is the first known treatment of the complexity classes \(\Sigma_2^P\), \(\Pi_2^P\) using active membranes without the features of polarizations, non elementary membrane division.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alhazov, A., Pan, L., Păun, G.: Trading Polarizations for Labels in P Systems with Active Membranes. Acta Informatica 41(2-3), 111–144 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alhazov, A., Freund, R.: On the Efficiency of P systems with Active Membranes and Two Polarizations. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 146–160. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Alhazov, A., Burtseva, L., Cojocaru, S., Rogozhin, Y.: Solving PP-Complete and #P-complete problems by P systems with active membranes. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 108–117. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Borodin, A.: On Relating Time and Space to Size and Depth. SIAM Journal of Computing 6(4), 733–744 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. Krishna, S.N., Ciobanu, G.: On the Computational Power of Enhanced Mobile Membranes. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 326–335. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Krishna, S.N., Ciobanu, G.: Enhanced Mobile Membranes: Computability Results. Theory of Computing Systems 48 (2011), doi:10.1007/s00224-010-9256-9).

    Google Scholar 

  7. Leporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M.J., Zandron, C.: Complexity Aspects of Polarizationless Membrane Systems. Natural Computing 8(4), 703–717 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  8. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Complexity Classes in Models of Cellular Computing with Membranes. Natural Computing 2(3), 265–285 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Pérez-Jiménez, M.J., Romero-Jiménez, A.: Trading Polarizations for Bi-stable Catalysts in P Systems with Active Membranes. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 373–388. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Pan, L., Ishdorj, T.-O.: P systems with Active Membranes and Separation Rules. Journal of Universal Computer Science 10, 630–649 (2004)

    MathSciNet  Google Scholar 

  11. Pan, L., Alhazov, A., Ishdorj, T.-O.: Further Remarks on P systems with Active Membranes, Separation, Merging, and Release Rules. Soft Computing 9(9), 686–690 (2005)

    Article  MATH  Google Scholar 

  12. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  13. Porreca, A.E., Leporati, A., Mauri, G., Zandron, C.: P Systems with Elementary Active Membranes: Beyond NP and coNP. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 338–347. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Păun, G.: P Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics 6(1), 75–90 (2001)

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  17. Zandron, C., Leporati, A., Ferretti, C., Mauri, G., Pérez-Jiménez, M.J.: On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution. Fundamenta Informaticae 87, 79–91 (2008)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IIT Bombay, Powai, Mumbai, 400 076, India

    Shankara Narayanan Krishna

  2. Romanian Academy, Institute of Computer Science and A.I.Cuza University of Iaşi, Romania

    Gabriel Ciobanu

Authors
  1. Shankara Narayanan Krishna
    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

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Markus Holzer

  2. Institut für Informatik, Universität Gießen, Arndtstraße 2, 35392, Gießen, Germany

    Martin Kutrib

  3. Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano, Via Comelico 39, 20135, Milano, Italy

    Giovanni Pighizzini

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krishna, S.N., Ciobanu, G. (2011). A \(\Sigma_2^P \cup \Pi_2^P\) Lower Bound Using Mobile Membranes. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22600-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22600-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22599-4

  • Online ISBN: 978-3-642-22600-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation