A uniform family of tissue P systems with cell division solving 3-COL in a linear time

  • Authors:
  • Daniel Díaz-Pernil;Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Agustín Riscos-Núñez

  • Affiliations:
  • Research Group on Natural Computing, Universidad de Sevilla, Sevilla, Spain;Research Group on Natural Computing, Universidad de Sevilla, Sevilla, Spain;Research Group on Natural Computing, Universidad de Sevilla, Sevilla, Spain;Research Group on Natural Computing, Universidad de Sevilla, Sevilla, Spain

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

Several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models of tissue-like P systems have received much attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems.