Lipton R J
Princeton University, NJ 08540, USA.
Science. 1995 Apr 28;268(5210):542-5. doi: 10.1126/science.7725098.
DNA experiments are proposed to solve the famous "SAT" problem of computer science. This is a special case of a more general method that can solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA-based computing. It has the potential to yield vast speedups over conventional electronic-based computers for such search problems.
有人提出进行DNA实验来解决计算机科学中著名的“SAT”问题。这是一种更通用方法的特殊情况，该方法可以解决NP完全问题。这些结果的优势在于基于DNA的计算所固有的巨大并行性。对于此类搜索问题，它有可能比传统的电子计算机实现大幅加速。
