No label defined (Q3972641)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 15994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 15994 |
Statements
25 June 1992
0 references
randomized approximation
0 references
percolation
0 references
computational complexity
0 references
enumeration problems
0 references
monomer-dimer problem
0 references
0.7510303854942322
0 references
0.7418889999389648
0 references
0.7410489320755005
0 references
[For the entire collection see Zbl 0714.00019.] The author reviews results on the difficulty of some combinatorial problems in statistical physics (e.g. percolation, Ising model). They are based on an extension of the notion of computational complexity to enumeration problems. All these problems are \(\sharp P\)-hard or \(\sharp P\)-complete, indicating their intractability. The author also mentions the randomised approximation of Jerrum and Sinclair of the monomer-dimer problem and discusses the fact, that despite their enumeration complexity some 2-dimensional problems are exactly solvable.
0 references
