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 -dimensional lattices for d > 2.
Funding Information
  • National Science Foundation (DGE-1656466)

This publication has 8 references indexed in Scilit: