Now showing items 1-5 of 5

    • Icon

      A linear-time tissue P system based solution for the 3-coloring problem  [Article]

      Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín (Elsevier, 2007)
      In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found (obviously, trading space for time). Recently, different new ...
    • Icon

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

      Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín; Rius Font, Miquel; Romero Campero, Francisco José (Taylor and Francis, 2013)
      The standard definition of tissue P systems includes a special alphabet whose elements are assumed to appear in the initial configuration of the system in an arbitrarily large number of copies. These objects reside in ...
    • Icon

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

      Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín (Elsevier, 2008)
      Several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models ...
    • Icon

      Membrane fission versus cell division: When membrane proliferation is not enough  [Article]

      Macías Ramos, Luis Felipe; Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín; Valencia Cabrera, Luis (Elsevier, 2015)
      Cell division is a process that produces two or more cells from one cell by replicating the original chromosomes so that each daughter cell gets a copy of them. Membrane fission is a process by which a biological membrane ...
    • Icon

      Solving Common Algorithmic Problem by Recognizer Tissue P Systems  [Article]

      Niu, Yunyun; Pan, Linqiang; Pérez Jiménez, Mario de Jesús (Romanian Academy, 2012)
      Common Algorithmic Problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. In this work, we deal with its decision version in the ...