NIU , Yunyun

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. A tissue P system with cell division is a computing model which has two basic characters: intercellular communication and the ability of cell division. The ability of cell division...

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 framework of tissue P systems. A tissue P system with cell division is a computing model which has two types of rules:...

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer is given by P. W. Shor in 1997. In this work, a linear-time solution for...

A tissue P system with cell division is a computing model which has two basic features: intercellular communication and the ability of cell division. The ability of cell division allows us to obtain an exponential amount of cells in linear time and to design cellular solutions to computationally hard problems in polynomial time. In this work we...