Related Experiment Video
Updated: Jul 8, 2026

Analyzing and Building Nucleic Acid Structures with 3DNA
Published on: April 26, 2013
Solution of a 20-variable 3-SAT problem on a DNA computer
Ravinderjit S Braich1, Nickolas Chelyapov, Cliff Johnson
1University of Southern California, Laboratory for Molecular Science, Los Angeles, CA 90089-1340, USA.
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 (2(20)) 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.
Related Concept Videos
DNA as a Genetic Template
DNA Microarrays
DNA as a Genetic Template
Statically Indeterminate Problem Solving
Castigliano's Theorem: Problem Solving
Functions of Three or More Variables

