CHARACTERIZING TRACTABILITY BY CELL-LIKE MEMBRANE SYSTEMS
Miguel Á. Gutiérrez-Naranjo, Mario J. Pérez-Jímenez, Agustín Riscos–Núñez, Francisco J. Romero–Campero, Álvaro Romero–Jiménez · Series in machine perception and artificial intelligence · 2006
In this paper we present a polynomial complexity class in the framework of membrane computing. In this context, and using accepting transition P systems, we provide a characterization of the standard computational class P of problems solvable in polynomial time by deterministic Turing machines. 1.