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. In Chengde Mao, Takashi Yokomori, editors, DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers. Volume 4287 of Lecture Notes in Computer Science, pages 47-57, Springer, 2006. [doi]
Abstract is missing.