title: DNA solution of hard computational problems.
abstract: 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.
authors.affiliation: Princeton University, NJ 08540, USA.
authors.forename: R J
authors.initials: RJ
authors.lastname: Lipton
mesh_terms: D003201:Computers; D004247:DNA; D008128:Logic; D008432:Mathematical Computing; D009838:Oligodeoxyribonucleotides
chemical_list: D009838:Oligodeoxyribonucleotides; D004247:DNA