Publication:4763511
From MaRDI portal
zbMath0825.68389MaRDI QIDQ4763511
Publication date: 18 April 1995
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
DNA computing: Arrival of biological mathematics, Solving the Hamiltonian path problem with a light-based computer, Unconventional complexity measures for unconventional computers, Approximate reasoning on a DNA‐chip, Exact cover with light, Graph-Theoretic Formalization of Hybridization in DNA Sticker Complexes, Solving the subset-sum problem with a light-based device, Graph-theoretic formalization of hybridization in DNA sticker complexes