Computational efficiency of dissolution rules in membrane systems
From MaRDI portal
Publication:3427661
DOI10.1080/00207160601065413zbMath1112.68060MaRDI QIDQ3427661
Mario J. Pérez-Jiménez, Francisco J. Romero-Campero, Agustín Riscos-Núñez, Miguel Á. Gutiérrez-Naranjo
Publication date: 23 March 2007
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/53705
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
A Framework for Complexity Classes in Membrane Computing, RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS, A Logarithmic Bound for Solving Subset Sum with P Systems, Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P, Evaluating space measures in P systems, A toolbox for simpler active membrane algorithms, The computational power of membrane systems under tight uniformity conditions, The counting power of P systems with antimatter, A Turing machine simulation by P systems without charges, Alternative space definitions for P systems with active membranes, Cell-like P systems with polarizations and minimal rules, Monodirectional P systems, Time-free solution to SAT problem using P systems with active membranes, A Characterisation of NL Using Membrane Systems without Charges and Dissolution
Cites Work