Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons.
Samuel ZbarskyPublished in: CoRR (2019)
Keyphrases
- detection algorithm
- improved algorithm
- times faster
- theoretical analysis
- computational complexity
- dynamic programming
- learning algorithm
- worst case
- probabilistic model
- search space
- np hard
- computational cost
- k means
- computationally efficient
- objective function
- optimization algorithm
- single pass
- matching algorithm
- path planning
- selection algorithm
- convergence rate
- memory efficient
- high accuracy
- cost function
- search algorithm
- similarity measure
- image processing