Computational efficiency of dissolution rules in membrane systems
From MaRDI portal
Publication:3427661
DOI10.1080/00207160601065413zbMath1112.68060OpenAlexW2012759215MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (14)
The counting power of P systems with antimatter ⋮ Evaluating space measures in 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 ⋮ A Turing machine simulation by P systems without charges ⋮ Alternative space definitions for P systems with active membranes ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ A toolbox for simpler active membrane algorithms ⋮ The computational power of membrane systems under tight uniformity conditions ⋮ A Logarithmic Bound for Solving Subset Sum with P Systems ⋮ Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P ⋮ Cell-like P systems with polarizations and minimal rules ⋮ Monodirectional P systems ⋮ A Framework for Complexity Classes in Membrane Computing
Cites Work
This page was built for publication: Computational efficiency of dissolution rules in membrane systems