Skip to main content
SpringerLink
Log in

On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems

  • Conference paper
  • First Online:
Membrane Computing (CMC 2015)

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

Included in the following conference series:

Abstract

In this paper, the communication complexity of non-confluent solutions for Vertex Cover Problem (VCP) and 3-Satisfiability Problem (3SP) in Evolution-Communication P systems (ECP) are analyzed. We use dynamical communication measures suggested by previous literature in our analysis. Solutions are constructed in several modes of operation: when communication is prioritized over evolution (CPE), when evolution is prioritized over communication (EPC) and when no priority is imposed (CME). VCP and 3SP are problems that have already been problems of interest for works that investigate communication complexity in an ECP system variant called Evolution-Communication P system with Energy (ECPe system). In this paper, we are interested in employing the technique used in ECPe system, this time for solutions in ECP system.

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 EPUB and 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

References

  1. Adorna, H., Păun, G., Pérez-Jiménez, M.J.: On communication complexity in evolution-communication P systems. Rom. J. Inf. Sci. Technol. 13(2), 113–130 (2010)

    Google Scholar 

  2. Alhazov, A.: Communication in Membrane Systems with Symbol Objects. Ph.D. thesis, Universitat Rovira I Virgili (2006)

    Google Scholar 

  3. Cavaliere, M.: Evolution–communication P systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 134–145. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Ciobanu, G., Păun, G., Stefanescu, G.: Sevilla carpets associated with P systems. In: Proceedings of the Brainstorming Week on Membrane Computing, Tarragona, Spain, pp. 135–140 (2003)

    Google Scholar 

  5. Francia, S., Francisco, D., Juayong, R., Adorna, H.: On communication complexity of some hard problems in ECPe systems with priority. Philippine Comput. J. 9(2), 14–25 (2014)

    Google Scholar 

  6. Gazdag, Z.: Solving SAT by P systems with active membranes in linear time in the number of variables. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 189–205. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  7. Gutiérrez-Naranjo, M.A., Pérez-Jímenez, M.J., Riscos-Núñez, A.: On descriptive complexity of P systems. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 320–330. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Hernandez, N.H.S., Juayong, R.A.B., Adorna, H.N.: On communication complexity of some hard problems in ECPe systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 206–224. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  9. Juayong, R., Adorna, H.: Communication complexity of evolution-communication P systems with energy and Sevilla carpet. Philippine Comput. J. 6(1), 34–40 (2010)

    Google Scholar 

  10. Lu, C., Zhang, X.: Solving vertex cover problem by means of tissue P systems with cell separation. Int. J. Comput. Commun. Control 5(4), 540–550 (2010)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. Păun, G.: Membrane Computing. Springer-Verlag, Heidelberg (2002)

    Book  MATH  Google Scholar 

  13. Păun, G.: Further open problems in membrane computing. In: Păun, G. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Sevilla, February 2004, Technical report, Research Group on Natural Computing, Sevilla University, Spain (2004)

    Google Scholar 

  14. Păun, G.: Introduction to membrane computing. In: Ciobanu, G., P ăun, G., Pérez-Jiménez, M.J. (eds.) Applications of Membrane Computing, pp. 1–42. Springer, Heidelberg (2006)

    Google Scholar 

  15. Pérez–Jiménez, M.J.: A computational complexity theory in membrane computing. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds.) WMC 2009. LNCS, vol. 5957, pp. 125–148. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Acknowledgments

N. Hernandez and R. Juayong would like to thank the DOST PCIEERD for the HRIDD HRDP grants I-15-1006-19 and I-15-0715-21, respectively. N. Hernandez is supported by the UPAA San Francisco & Mely & Rick Ray foundation professorial chair. R. Juayong is supported by the DOST-ERDT Scholarship Program. H. Adorna is funded by a DOST-ERDT research grant and the Semirara Mining Corporation professorial chair of the UP Diliman, College of Engineering.

Author information

Authors and Affiliations

  1. Algorithms and Complexity Laboratory, Department of Computer Science, University of the Philippines Diliman, Diliman, 1101, Quezon City, Philippines

    Nestine Hope S. Hernandez, Richelle Ann B. Juayong, Sherlyne L. Francia, Denise Alyssa A. Francisco & Henry N. Adorna

Authors
  1. Nestine Hope S. Hernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richelle Ann B. Juayong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sherlyne L. Francia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Denise Alyssa A. Francisco
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Henry N. Adorna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richelle Ann B. Juayong .

Editor information

Editors and Affiliations

  1. LIACS, Leiden University, Leiden, Zuid-Holland, The Netherlands

    Grzegorz Rozenberg

  2. Turku Center for Computer Science, Turku, Finland

    Arto Salomaa

  3. Universidad Politécnica de Valencia, Valencia, Spain

    José M. Sempere

  4. University of Milan-Bicocca, Milano, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Hernandez, N.H.S., Juayong, R.A.B., Francia, S.L., Francisco, D.A.A., Adorna, H.N. (2015). On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECP Systems. In: Rozenberg, G., Salomaa, A., Sempere, J., Zandron, C. (eds) Membrane Computing. CMC 2015. Lecture Notes in Computer Science(), vol 9504. Springer, Cham. https://doi.org/10.1007/978-3-319-28475-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28475-0_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28474-3

  • Online ISBN: 978-3-319-28475-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation