DNA Solution of Hard Computational Problems

DNA Solution of Hard Computational Problems

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 vas...

Full description

Saved in:
Bibliographic Details
Published in:Science (American Association for the Advancement of Science) Vol. 268; no. 5210; pp. 542 - 545
Main Author: Lipton, Richard J.
Format: Journal Article
Language:English
Published: Washington, DC American Society for the Advancement of Science 28-04-1995
American Association for the Advancement of Science
The American Association for the Advancement of Science
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Boolean data
Boolean value
Computer science; control theory; systems
Computers
Deoxyribonucleic acid
DNA
Exact sciences and technology
Logic
Mathematical Computing
Nucleotide sequences
Oligodeoxyribonucleotides
Parallel processing
Personality
Standardized tests
Teaching Methods
Theoretical computing
Vertices
Search problem
Parallelism
NP complete problem
Computing
Mathematical model
DNA
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0036-8075
1095-9203
DOI:10.1126/science.7725098