Solving vertex cover problem using DNA tile assembly model

DOI10.1155/2013/407816MaRDI QIDQ1789891zbMATH OpenOpenAlexWikidataFDO

Authors Tao Song, Yufang Huang, Xiaolong Shi, Zhihua Chen

Publication date 10 October 2018

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/407816

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Solving NP-complete problems in the tile assembly model
• Constant-Size Tileset for Solving an NP-Complete Problem in Nondeterministic Linear Time
• Improving efficiency of 3-SAT-solving tile systems
• Solving satisfiability in the tile assembly model with a constant-size tileset
• scientific article; zbMATH DE number 1738642

Cited in

(2)

• An efficient tile assembly model for maximum matching problem
• Improving efficiency of 3-SAT-solving tile systems

This page was built for publication: Solving vertex cover problem using DNA tile assembly model

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