The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. |
scientific article |
Statements
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (English)
0 references
17 August 2003
0 references
self-avoiding walks
0 references
0 references
