How efficiently can room at the bottom be traded away for speed at the top?

DOI10.1023/B:NACO.0000006776.97214.c5zbMath1082.68037OpenAlexW2116081828MaRDI QIDQ1426835

Pilar de la Torre

Publication date: 15 March 2004

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:naco.0000006776.97214.c5

zbMATH Keywords

\(k\)-SATbio-molecular and classical algorithmsCovering Code Creationrandomized bio-molecular computing modelsub-exponential space and time product efficiency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)