Journal Article

Solution of a 20-variable 3-SAT problem on a DNA computer

Science (2002) 296(5567) 499-502
DOI: 10.1126/science.1069528
530Citations
Citations of this article
191Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (220) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of unaided human computation.

Cite

CITATION STYLE

APA

Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., & Adleman, L. (2002). Solution of a 20-variable 3-SAT problem on a DNA computer. Science, 296(5567), 499–502. https://doi.org/10.1126/science.1069528

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free