A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time

DOI10.1007/978-3-319-21819-9_18zbMath1465.68083OpenAlexW2235536662MaRDI QIDQ2945571

T. Mathu, Hepzibah A. Christinal, Daniel Díaz-Pernil

Publication date: 14 September 2015

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21819-9_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Solving the 3-COL problem by using tissue P systems without environment and proteins on cells

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational efficiency and universality of timed P systems with active membranes
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• Computational complexity of tissue-like P systems
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Tissue P systems.
• Computing with membranes
• Tissue P systems with channel states
• Membrane computing. An introduction.
• Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
• Cell communication in tissue \(P\) systems: universality results
• 3-Col problem modelling using simple kernel P systems
• Developments in Language Theory

This page was built for publication: A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time