The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212)
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 Computational Complexity of the Tutte Plane: the Bipartite Case |
scientific article; zbMATH DE number 563595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computational Complexity of the Tutte Plane: the Bipartite Case |
scientific article; zbMATH DE number 563595 |
Statements
The Computational Complexity of the Tutte Plane: the Bipartite Case (English)
0 references
5 May 1994
0 references
computational complexity
0 references
Tutte plane
0 references
Tutte polynomial
0 references
spanning trees
0 references
partition function
0 references
planar Ising model
0 references
