Q3972641
type: Item
instance of: scholarly article
zbMATH Open document ID: 0737.60094
publication date: 1992-06-25T00:00:00Z
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 15994
zbMATH Keywords: randomized approximation
zbMATH Keywords: percolation
zbMATH Keywords: computational complexity
zbMATH Keywords: enumeration problems
zbMATH Keywords: monomer-dimer problem
author: D. J. A. Welsh
MaRDI profile type: MaRDI publication profile
Recommended article: Approximating the Partition Function of the Ferromagnetic Potts Model
Recommended article: Q4226452
Recommended article: A Computational Proof of Complexity of Some Restricted Counting Problems
Recommended article: A computational proof of complexity of some restricted counting problems
description: scientific article; zbMATH DE number 15994