DocumentCode
2143953
Title
Solving intractable problems with DNA computing
Author
Beigel, Richard ; Fu, Bin
Author_Institution
Lehigh Univ., Bethlehem, PA, USA
fYear
1998
fDate
15-18 Jun 1998
Firstpage
154
Lastpage
168
Abstract
We survey the theoretical use of DNA computing to solve intractable problems. We also discuss the relationship between problems in DNA computing and questions in complexity theory
Keywords
computational complexity; genetic algorithms; DNA computing; complexity theory; intractable problems; Annealing; Biological information theory; Bonding; Chemicals; Complexity theory; DNA computing; Fault tolerance; Hydrogen; NP-complete problem; Sequences;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
Conference_Location
Buffalo, NY
ISSN
1093-0159
Print_ISBN
0-8186-8395-3
Type
conf
DOI
10.1109/CCC.1998.694601
Filename
694601
Link To Document