Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons

03/10/2019

∙

by   Samuel Zbarsky, et al.

∙

0

∙

share

We give an algorithm for counting self-avoiding walks or self-avoiding polygons that runs in time (C√(n n)) on 2-dimensional lattices and time (C_dn^(d-1)/d n) on d-dimensional lattices for d>2.