%0 Generic
%D 2010
%T A Computational Complexity Theory in Membrane Computing
%A Mario J. Pérez-Jiménez
%C Amsterdam, The Netherlands
%I Springer
%P 125-148
%R 10.1007/978-3-642-11467-0_10
%U http://springerlink.com/content/q3u67763r37q6362/?p=be4b72c586c644468162938b28dbcac8&pi=9
%V 5957
%X In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P ≠ NP conjecture within the framework of a bio-inspired and non-conventional computing model are deduced.
%Z (invited talk).
Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009, Revised Selected and Invited Papers.
%8 01/2010