Title :
Solving intractable problems with DNA computing
Author :
Beigel, Richard ; Fu, Bin
Author_Institution :
Lehigh Univ., Bethlehem, PA, USA
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;
Conference_Titel :
Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
Conference_Location :
Buffalo, NY
Print_ISBN :
0-8186-8395-3
DOI :
10.1109/CCC.1998.694601
