An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes-Reference-Cited by-同舟云学术

An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes

Published:2010 Issue: Volume: Page:461-478
ISSN:0302-9743
Container-title:Membrane Computing
language:
Short-container-title:

Author:

Valsecchi Andrea,Porreca Antonio E.,Leporati Alberto,Mauri Giancarlo,Zandron Claudio

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-11467-0_31.pdf

Reference22 articles.

1. Alhazov, A., Martín-Vide, C., Pan, L.: Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes. Fundamenta Informaticae 58(2), 67–77 (2003)

2. Alhazov, A., Freund, R.: On the efficiency of P systems with active membranes and two polarizations. In: Mauri, G., et al. (eds.) Membrane Computing, pp. 81–94. Springer, Heidelberg (2005)

3. Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I, 2nd edn. Springer, Heidelberg (1995)

4. Lecture Notes in Computer Science;M.A. Gutiérrez-Naranjo,2005

5. Lecture Notes in Computer Science;M.-A. Gutiérrez-Naranjo,2006

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Evaluating space measures in P systems;Journal of Membrane Computing;2022-09

2. Subroutines in P systems and closure properties of their complexity classes;Theoretical Computer Science;2020-01

3. P systems attacking hard problems beyond NP: a survey;Journal of Membrane Computing;2019-07-29

4. Time and Space Complexity of P Systems — And Why They Matter;Membrane Computing;2019

5. Space complexity equivalence of P systems with active membranes and Turing machines;Theoretical Computer Science;2014-04