A uniform family of tissue P systems with cell division solving 3-COL in a linear time
From MaRDI portal
Publication:953542
DOI10.1016/j.tcs.2008.04.005zbMath1151.68016OpenAlexW2051931262MaRDI QIDQ953542
Mario J. Pérez-Jiménez, Daniel Díaz-Pernil, Miguel Á. Gutiérrez-Naranjo, Agustín Riscos-Núñez
Publication date: 6 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.005
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coloring of graphs and hypergraphs (05C15)
Related Items (23)
The computational power of tissue-like P systems with promoters ⋮ Membrane computing to enhance time efficiency of minimum dominating set ⋮ A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time ⋮ Rule synchronization for monodirectional tissue-like P systems with channel states ⋮ A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time ⋮ Accelerated execution of P systems with active membranes to solve the \(N\)-queens problem ⋮ Towards automated deduction in cP systems ⋮ P systems and computational algebraic topology ⋮ A time-free uniform solution to subset sum problem by tissue P systems with cell division ⋮ Simple Neural-Like P Systems for Maximal Independent Set Selection ⋮ Cell-like P systems with evolutional symport/antiport rules and membrane creation ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ Time-free solution to SAT problem by tissue P systems ⋮ Designing a new software tool for digital imagery based on P systems ⋮ Tissue P systems with cell separation: attacking the partition problem ⋮ A P-Lingua based simulator for tissue P systems ⋮ Tissue-like P systems with evolutional symport/antiport rules ⋮ Alternative representations of P systems solutions to the graph colouring problem ⋮ Rule synchronization for tissue P systems ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states ⋮ 3-Col problem modelling using simple kernel P systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of communication: P systems with symport/antiport
- 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.
- Cell communication in tissue \(P\) systems: universality results
- Developments in Language Theory
- Brane Calculi
- Membrane Computing
- Aspects of Molecular Computing
This page was built for publication: A uniform family of tissue P systems with cell division solving 3-COL in a linear time
