ON A PARTIAL AFFIRMATIVE ANSWER FOR A PĂUN'S CONJECTURE

DOI10.1142/S0129054111007824zbMath1213.68275OpenAlexW2019793708WikidataQ123096352 ScholiaQ123096352MaRDI QIDQ3076597

Mario J. Pérez-Jiménez, M. Rius-Font, Miguel Á. Gutiérrez-Naranjo, Agustín Riscos-Núñez, Ignacio Pérez-Hurtado

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111007824

zbMATH Keywords

computational complexitytractabilityactive membranesdissolution rulespolarizationless P systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A path to computational efficiency through membrane computing

Cites Work

• Complexity classes in models of cellular computing with membranes

This page was built for publication: ON A PARTIAL AFFIRMATIVE ANSWER FOR A PĂUN'S CONJECTURE