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

DOI10.1016/J.INS.2017.11.022MaRDI QIDQ781876zbMATH OpenOpenAlexFDO

Authors Daniel Díaz-Pernil, Hepzibah A. Christinal, Miguel A. Gutiérrez-Naranjo

Publication date 20 July 2020

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

membrane computingP-systems3-COL problem

Mathematics Subject Classification ID

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

Recommendations

• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
• A linear-time tissue P system based solution for the 3-coloring problem
• 3-Col problem modelling using simple kernel P systems
• Alternative representations of P systems solutions to the graph colouring problem

Cites work

• scientific article; zbMATH DE number 1583885 (Why is no real title available?)
• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1951592 (Why is no real title available?)
• scientific article; zbMATH DE number 2089984 (Why is no real title available?)
• scientific article; zbMATH DE number 5040091 (Why is no real title available?)
• A polynomial alternative to unbounded environment for tissue P systems with cell division
• A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
• Active membranes, proteins on membranes, tissue P systems: complexity-related issues and challenges
• An unsupervised learning algorithm for membrane computing
• Asynchronous spiking neural P systems with local synchronization
• Computational complexity of tissue-like P systems
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Fuzzy reasoning spiking neural P system for fault diagnosis
• Membrane Computing
• P systems with proteins on membranes
• P systems with proteins on membranes characterize PSPACE
• P systems with proteins on membranes: a survey
• The complexity of theorem-proving procedures
• The efficiency of tissue P systems with cell separation relies on the environment
• The relevance of the environment on the efficiency of tissue P systems
• Tissue P systems with channel states
• Tissue P systems with protein on cells
• Tissue P systems.

Cited in

(11)

• Small universal improved spiking neural P systems with multiple channels and autapses
• A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
• A uniform family of tissue P systems with cell division solving 3-COL in a linear time
• 3-Col problem modelling using simple kernel P systems
• Spiking neural P systems with autapses
• A linear-time tissue P system based solution for the 3-coloring problem
• Weighted spiking neural P systems with polarizations and anti-spikes
• Spiking neural P systems without duplication
• Homeostasis tissue-like P systems with cell separation
• A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time
• Alternative representations of P systems solutions to the graph colouring problem

This page was built for publication: Solving the 3-COL problem by using tissue P systems without environment and proteins on cells

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781876)