Solving the subset sum problem with a nonideal biological computer
We consider the solution of the subset sum problem based on a parallel computer consisting of self-propelled biological agents moving in a nanostructured network that encodes the computing task in its geometry. We develop an approximate analytical method to analyze the effects of small errors in the...
Main Authors: | Michael Konopik, Till Korten, Heiner Linke, Eric Lutz |
---|---|
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/ac2005 |
Similar Items
-
Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem
by: Kolpakov Roman, et al.
Published: (2020-12-01) -
Subset sum pseudorandom numbers: fast generation and distribution
by: von zur Gathen Joachim, et al.
Published: (2009-08-01) -
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
by: Bo Moon
Published: (2012-01-01) -
On Sum-Free Subsets of Abelian Groups
by: Renato Cordeiro de Amorim
Published: (2023-07-01) -
Basis Reduction Algorithms and Subset Sum Problems
by: LaMacchia, Brian A.
Published: (2004)