Skip to main content
SpringerLink
Log in

Solving HPP and SAT by P Systems with Active Membranes and Separation Rules

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

Abstract

The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obtaining an exponential working space in a linear time, and on this basis solving hard problems, typically NP-complete problems, in polynomial (often, linear) time. In this paper, using another way to obtain exponential working space – membrane separation, it was shown that Satisfiability Problem and Hamiltonian Path Problem can be deterministically solved in linear or polynomial time by a uniform family of P systems with separation rules, where separation rules are not changing labels, but polarizations are used. Some related open problems are mentioned.

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. Alhazov A., Martí n-Vide C., Pan L. (2003). Solving a PSPACE-complete problem by P systems with restricted active membranes. Fundam. Inf. 58(2):66–77

    Google Scholar 

  2. Alhazov A., Pan L. (2004). Polarizationless P systems with active membranes. Grammars 7(1):141–159

    Google Scholar 

  3. Alhazov A., Pan L., Păun Gh. (2004). Trading polarizations for labels in P systems with active membranes. Acta Inf. 41:111–144

    Article  MATH  Google Scholar 

  4. Alhazov, A., Ishdorj, T.-O.: Membrane Operations in P Systems with Active Membranes. In: Păun, Gh., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Capparini, F. (eds.) Second Brainstorming Week on Membrane Computing, Sevilla, 2–7 February. Research Group in Natural Computing TR 01/2004, University of Sevilla, 37–44 (2004)

  5. Burger K.N.J. (2000). Greasing membrane fusion and fission machineries. Traffic 1:605–613

    Article  Google Scholar 

  6. Garey, M.R., Johnson, D.J.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979).

  7. Pan, L., Alhazov, A., Ishdorj, T.-O.: Further Remarks on P Systems with Active Membranes, Separation, Merging and Release Rules. In: Păun, Gh., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Capparini, F. (eds.) Second Brainstorming Week on Membrane Computing, Sevilla, 2–7 February. Research Group in Natural Computing TR 01/2004, University of Sevilla, pp. 316–324. Also in Soft Comput. 8, 1–5 (2004)

  8. Papadimitriou Ch.P. (1994). Computational Complexity, Addison-Wesley, Reading

    MATH  Google Scholar 

  9. Păun A. (2000). On P Systems with Membrane Division. In: Antoniou I., Calude C.S., Dinneen M.J. (eds) Unconventional Models of Computation. Springer, London, pp. 187–201

    Google Scholar 

  10. Păun Gh. (2000). Computing with membranes. J. Comput. Syst. Sci. 61(1):108–143

    Article  MATH  Google Scholar 

  11. Păun Gh. (2001). P systems with active membranes: attacking NP-complete problems. J. Automata Lang. Combinatorics 6(1):75–90

    MATH  Google Scholar 

  12. Păun Gh. (2002). Computing with Membranes: an introduction. Springer, Berlin Heidelberg New York

    Google Scholar 

  13. Pérez-Jiménez M.J., Romero-Jiménez A., Sancho-Caparrini F. (2003). Complexity classes in models of cellular computation with membranes. Nat. Comput. 2(3):265–285

    Article  MathSciNet  MATH  Google Scholar 

  14. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Teoría de la Complejidad en Modelos de Computatión Celular con Membranas, Editorial Kronos, Sevilla, (2002)

  15. Rozenberg G., Salomaa A. (eds) (1997). Handbook of Formal Languages (3 volumes). Springer, Berlin Heidelberg New York

    Google Scholar 

  16. Salomaa A. (1973). Formal Languages. Academic, New York

    MATH  Google Scholar 

  17. Sosí k, P.: Solving a PSPACE-Complete Problem by P Systems with Active Membranes. In: Proceedings of the Brainstorming Week on Membrane Computing (Cavaliere, M., Martín-Vide, C., Păun, Gh. (eds.) Report GRLMC 26/03, pp 305–312 (2003)

Download references

Author information

Authors and Affiliations

  1. Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, 430074, Hubei, People’s Republic of China

    Linqiang Pan

  2. Institute of Mathematics and Computer Science, Academy of Science of Moldova, Str. Academiei 5, Chişinău, MD 2028, Moldova

    Artiom Alhazov

  3. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Linqiang Pan

Authors
  1. Linqiang Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Artiom Alhazov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Linqiang Pan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pan, L., Alhazov, A. Solving HPP and SAT by P Systems with Active Membranes and Separation Rules. Acta Informatica 43, 131–145 (2006). https://doi.org/10.1007/s00236-006-0018-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-006-0018-8

Keywords

Search

Navigation