scientific article; zbMATH DE number 743584
From MaRDI portal
Publication:4763511
zbMath0825.68389MaRDI QIDQ4763511
Publication date: 18 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (8)
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
This page was built for publication:
