On molecular approximation algorithms for NP optimization problem
暂无分享,去创建一个
[1] Bin Fu,et al. Molecular Computing, Bounded Nondeterminism, and Efficient Recursion , 1997, Algorithmica.
[2] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[3] Mitsunori Ogihara. Breadth First Search 3SAT Algorithms for DNA Computers , 1996 .
[4] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[5] Bin Fu,et al. A Comparison of Resource-Bounded Molecular Computation Models , 1999, Algorithmica.
[6] Eric Bach,et al. DNA models and algorithms for NP-complete problems , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[7] J.,et al. Using DNA to Solve NP-Complete ProblemsRichard , 1995 .