𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cut-and-Permute Algorithm for Self-Avoiding Walks in the Presence of Surfaces

✍ Scribed by Maria Serena Causo

Book ID
110336978
Publisher
Springer
Year
2002
Tongue
English
Weight
221 KB
Volume
108
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Correction of scaling exponents for self
Correction of scaling exponents for self-avoiding walks in two dimensions
✍ Jean Dayantis; Jean-François Palierne 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB

## Abstract The first and second correction‐to‐scaling exponents for two‐dimensional self‐avoiding walks have been estimated using exact enumeration data up to twenty‐two steps, and Monte Carlo simulation data from twenty‐three up to two hundred steps. It was found that Δ~1~, the first correction‐t

The complexity of counting self-avoiding
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
✍ Maciej Liśkiewicz; Mitsunori Ogihara; Seinosuke Toda 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Valiant (SIAM J. Comput. 8 (1979) 410 -421) showed that the problem of computing the number of simple s-t paths in graphs is #P-complete both in the case of directed graphs and in the case of undirected graphs. Welsh (Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge,