Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Complexities for generalized models of self-assembly;Aggarwal;SIAM Journal on Computing,2005
2. Leonard Adleman, Qi Cheng, Ashish Goel, Ming-Deh Huang, David Kempe, Pablo Moisset de Espanes, Paul Rothermund, Combinatorial optimization problems in self-assembly, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2002, pp. 23–32
3. Molecular computation of solutions to combinatorial problems;Adleman;Science,1994
4. Leonard Adleman, Towards a mathematical theory of self-assembly, Technical Report 00-722, Department of Computer Science, University of Southern California, Los Angeles, CA, 2000
5. Leonard Adleman, Ashish Goel, Ming-Deh Huang, Pablo Moisset de Espanes, Running time and program size for self-assembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 740–748
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献