Abstract
Inspired by the cell motion expressed by endocytosis and exocytosis, we propose a class of membrane systems which uses elementary membrane division and mobility of membranes. We show that this class of mobile membranes using only elementary division and mobility can provide a semi-uniform polynomial solutions for the 4QBF problem, ascending to the fourth level in the polynomial hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aman, B., Ciobanu, G.: Describing the Immune System Using Enhanced Mobile Membranes. Electronic Notes in Theoretical Computer Science 194, 5–18 (2008)
Aman, B., Ciobanu, G.: Turing Completeness Using Three Mobile Membranes. In: Calude, C.S., Costa, J.F., Dershowitz, N., Freire, E., Rozenberg, G. (eds.) UC 2009. LNCS, vol. 5715, pp. 42–55. Springer, Heidelberg (2009)
Aman, B., Ciobanu, G.: Simple, Enhanced and Mutual Mobile Membranes. In: Priami, C., Back, R.-J., Petre, I. (eds.) Transactions on Computational Systems Biology XI. LNCS, vol. 5750, pp. 26–44. Springer, Heidelberg (2009)
Aman, B., Ciobanu, G.: Mobility in Process Calculi and Natural Computing. Springer (2011)
Krishna, S.N., Aman, B., Ciobanu, G.: On the Computability Power of Membrane Systems with Controlled Mobility. In: Cooper, S.B., Dawar, A., Löwe, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 626–635. Springer, Heidelberg (2012)
Ciobanu, G., Krishna, S.N.: Enhanced Mobile Membranes: Computability Results. Theory of Computing Systems 48(3), 715–729 (2011)
Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds.): Applications of Membrane Computing. Springer (2006)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
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)
Krishna, S.N., Ciobanu, G.: A \(\Sigma_2^P \cup \Pi_2^P\) Lower Bound Using Mobile Membranes. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 275–288. Springer, Heidelberg (2011)
Krishna, S.N., Păun, G.: P Systems with Mobile Membranes. Natural Computing 4, 255–274 (2005)
Meyer, A.R., Stockmeyer, L.J.: The Equivalence Problem for Regular Expressions With Squaring Requires Exponential Time. In: Proc. 13th Ann. Symp. on Switching and Automata Theory, pp. 125–129. IEEE Computer Society Press (1972)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press (2010)
Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity-Membrane Division, Membrane Creation. In: [15], 302–336
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aman, B., Ciobanu, G., Krishna, S.N. (2013). Solving the 4QBF Problem in Polynomial Time by Using the Biological-Inspired Mobility. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-36071-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36070-1
Online ISBN: 978-3-642-36071-8
eBook Packages: Computer ScienceComputer Science (R0)