Molecular computing, bounded nondeterminism, and efficient recursion
From MaRDI portal
Publication:1125447
DOI10.1007/PL00008275zbMath0951.68511OpenAlexW1970461358MaRDI QIDQ1125447
Publication date: 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00008275
Related Items (2)
The complexity of dependency detection and discovery in relational databases ⋮ Monotone Boolean dualization is in co-NP\([\log^{2}n\).]
This page was built for publication: Molecular computing, bounded nondeterminism, and efficient recursion
