The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. |
scientific article; zbMATH DE number 1965393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. |
scientific article; zbMATH DE number 1965393 |
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
0.8909512
0 references
0.8870131
0 references
0 references
0.8776025
0 references
0.8762854
0 references
0 references
0.87401694
0 references
