As good as it gets: a scaling comparison of DNA computing, network biocomputing, and electronic computing approaches to an NP-complete problem

As good as it gets: a scaling comparison of DNA computing, network biocomputing, and electronic computing approaches to an NP-complete problem

All known algorithms to solve nondeterministic polynomial (NP) complete problems, relevant to many real-life applications, require the exploration of a space of potential solutions, which grows exponentially with the size of the problem. Since electronic computers can implement only limited parallel...

Full description

Bibliographic Details
Main Authors: Ayyappasamy Sudalaiyadum Perumal, Zihao Wang, Giulia Ippoliti, Falco C M J M van Delft, Lila Kari, Dan V Nicolau
Format: Article
Language:English
Published: IOP Publishing 2021-01-01
Series:New Journal of Physics
Subjects:
unconventional computing
natural computing
DNA computing
network biocomputing
NP-complete problem
subset sum problem
Online Access:https://doi.org/10.1088/1367-2630/ac3883

Internet

https://doi.org/10.1088/1367-2630/ac3883

Similar Items