Design of network-based biocomputation circuits for the exact cover problem

Exact cover is a non-deterministic polynomial time (NP)—complete problem that is central to optimization challenges such as airline fleet planning and allocation of cloud computing resources. Solving exact cover requires the exploration of a solution space that increases exponentially with cardinali...

Full description

Bibliographic Details
Main Authors: Till Korten, Stefan Diez, Heiner Linke, Dan V Nicolau Jr, Hillel Kugler
Format: Article
Language:English
Published: IOP Publishing 2021-01-01
Series:New Journal of Physics
Subjects:
Online Access:https://doi.org/10.1088/1367-2630/ac175d