Searching for "All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB