On the Power of DNA-Computing

Information and Computation

Volumn 131, Issue 2, 1996, Pages 95-109

  Rooß, Diana ^a   Wagner, Klaus W ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13544274407     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0094     Document Type: Article

References (8)

1. Adleman, L. M. (1994), Molecular computation of solutions to combinatorial problems, Science 266, 1021-1024.
2. Bovet, D., and Crescenzi, P. (1994), "Introduction to the Theory of Complexity," Prentice-Hall, New York/London/Toronto/Sydney/Tokyo/Singapore.
3. Bernstein, E., and Vazirani, U. (1993), Quantum complexity theory, in "Proceedings of the 25th Annual ACM Symposium on the Theory of Computing," pp. 11-20.
4. Deutsch, D. (1985), Quantum theory, the Church-Turing principle and the universal quantum computer, in "Proceedings of the Royal Society London," Vol. A400, pp. 97-117.
5. Lipton, R. J. (1994), Speeding up computations via molecular biology, Technical report. Princeton University.
6. Lipton, R. J. (1995), Using DNA to solve NP-complete problems, Technical report. Princeton University.
7. Pudlák, P. (1994), Complexity theory and genetics, in "Proceedings of 9th Conference on Structure in Complexity Theory," pp. 183-195.
8. Shor, P. W. (1994), Algorithms for quantum computation: Discrete logarithms and factoring, in "Proceedings of the 35th IEEE Symposium on Foundations of Computer Science," pp. 124-134.