scientific article; zbMATH DE number 15994

zbMATH Open0737.60094MaRDI QIDQ3972641FDOQ3972641

Authors D. J. A. Welsh

Publication date 25 June 1992

zbMATH Keywords

computational complexitypercolationmonomer-dimer problemrandomized approximationenumeration problems

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1246229
• A Computational Proof of Complexity of Some Restricted Counting Problems
• A computational proof of complexity of some restricted counting problems

Cited in

(21)

• Eulerian digraphs and toric Calabi-Yau varieties
• The Computational Complexity of the Tutte Plane: the Bipartite Case
• Counting over non-planar graphs
• scientific article; zbMATH DE number 5953237 (Why is no real title available?)
• The computational complexity of generating random fractals
• A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
• The computational complexity of knot and matroid polynomials
• Approximating the number of monomer-dimer coverings of a lattice.
• Propriety conditions for the Bayesian autologistic model-inference for histone modifications
• Computational complexity of loss networks
• Algorithmic information and simplicity in statistical physics
• scientific article; zbMATH DE number 7650083 (Why is no real title available?)
• Statistical complexity and classical-quantum frontier
• Matrix permanent and quantum entanglement of permutation invariant states
• The hierarchical parity model
• Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
• A strong log-concavity property for measures on Boolean algebras
• On the unimodality of the independent set numbers of a class of matroids
• A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models
• On the number of Eulerian orientations of a graph
• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972641)