Solving the 3‐Satisfiability Problem Using Network‐Based Biocomputation

Solving the 3‐Satisfiability Problem Using Network‐Based Biocomputation

The 3‐satisfiability Problem (3‐SAT) is a demanding combinatorial problem that is of central importance among the nondeterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence, and logistics. Even with optimized algorithms, the solution space that n...

Full description

Bibliographic Details
Main Authors: Jingyuan Zhu, Aseem Salhotra, Christoph Robert Meinecke, Pradheebha Surendiran, Roman Lyttleton, Danny Reuter, Hillel Kugler, Stefan Diez, Alf Månsson, Heiner Linke, Till Korten
Format: Article
Language:English
Published: Wiley 2022-12-01
Series:Advanced Intelligent Systems
Subjects:
molecular motors
nanofabrication
network-based biocomputation
nondeterministic polynomials
parallel computation
satisfiability problems
Online Access:https://doi.org/10.1002/aisy.202200202

Internet

https://doi.org/10.1002/aisy.202200202

Similar Items