An ~ O ( 2 n ) Volume Molecular Algorithm for Hamiltonian Pathsubmitted to DNA ' 98

@inproceedings{Fu1998AnO,
  title={An ~ O ( 2 n ) Volume Molecular Algorithm for Hamiltonian Pathsubmitted to DNA ' 98},
  author={Bin Fu and Richard and Beigely and Fang Xiao},
  year={1998}
}
We design volume-eecient molecular algorithms for all problems in #P, using only reasonable biological operations. In particular, we give a polynomial-time O(2 n n 2 log 2 n)-volume algorithm to compute the number of Hamiltonian paths in an n-node graph. This improves Adleman's celebrated n!-volume algorithm for nding a single Hamiltonian path.