Abstract
We give an algorithm for counting self-avoiding walks or self-avoiding polygons of length n that runs in time on 2-dimensional lattices and time on d-......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
