Complexity of restricted and unrestricted models of molecular computation

Erik Winfree. Complexity of restricted and unrestricted models of molecular computation. In Richard J. Lipton, Eric B. Baum, editors, DNA Based Computers, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 4, 1995. Volume 27 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 187-198, DIMACS/AMS, 1995.

@inproceedings{Winfree95,
  title = {Complexity of restricted and unrestricted models of molecular computation},
  author = {Erik Winfree},
  year = {1995},
  researchr = {https://researchr.org/publication/Winfree95},
  cites = {0},
  citedby = {0},
  pages = {187-198},
  booktitle = {DNA Based Computers, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 4, 1995},
  editor = {Richard J. Lipton and Eric B. Baum},
  volume = {27},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}