All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size.

Florin Manea Carlos Martín-Vide Victor Mitrana All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size. 47-57 2006 conf/dna/2006 DNA http://dx.doi.org/10.1007/11925903_4 db/conf/dna/dna2006.html#ManeaMM06