Login / Signup
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
Published in:
DNA (2006)
Keyphrases
</>
computational complexity
np complete
network size
np hardness
social networks
optimization problems
parallel algorithm
decision problems
complex networks
benchmark problems
computational biology
parallel computing
min sum
alphabet size