An efficient tile assembly model for maximum matching problem

MaRDI QIDQ3196086zbMATH OpenFDO

Authors Xu Zhou, Yantao Zhou, KenLi Li, Guo Pan

Publication date 28 October 2015

zbMATH Keywords

DNA computingmaximum matching problemNP-complete problemparallel computingtile self-assembly model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20)

Recommendations

• Solving NP-complete problems in the tile assembly model
• Unconventional Computation
• Solving vertex cover problem using DNA tile assembly model
• Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time
• Program size and temperature in self-assembly

This page was built for publication: An efficient tile assembly model for maximum matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196086)