A polynomial alternative to unbounded environment for tissue P systems with cell division

DOI10.1080/00207160.2012.748898zbMath1286.68142OpenAlexW2035718458MaRDI QIDQ2852130

Mario J. Pérez-Jiménez, M. Rius-Font, Agustín Riscos-Núñez, Francisco J. Romero-Campero

Publication date: 8 October 2013

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

Full work available at URL: https://idus.us.es/xmlui/handle//11441/79751

zbMATH Keywords

computational complexitycell divisionmembrane computingtissue P systemsenvironment of a tissue

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A path to computational efficiency through membrane computing ⋮ Membrane fission versus cell division: when membrane proliferation is not enough ⋮ The environment as a frontier of efficiency in tissue P systems with communication rules ⋮ Seeking computational efficiency boundaries: the Păun's conjecture ⋮ P systems with symport/antiport rules: when do the surroundings matter? ⋮ Solving the 3-COL problem by using tissue P systems without environment and proteins on cells ⋮ P systems with evolutional communication and separation rules

Cites Work

• Tissue P systems.
• Complexity classes in models of cellular computing with membranes
• Computing with membranes
• The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment
• Characterizing Tractability by Tissue-Like P Systems

This page was built for publication: A polynomial alternative to unbounded environment for tissue P systems with cell division