We design volume-efficient molecular algorithms for all problems in #P, usi
ng only reasonable biological operations. In particular, we give a polynomi
al-time O(2(n)n(2) log(2) n)-volume algorithm to compute the number of Hami
ltonian paths in an n-node graph. This improves Adleman's celebrated n!-vol
ume algorithm for finding a single Hamiltonian path. (C) 1999 Elsevier Scie
nce Ireland Ltd. All rights reserved.