scientific article
From MaRDI portal
Publication:3972641
zbMath0737.60094MaRDI QIDQ3972641
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitypercolationenumeration problemsmonomer-dimer problemrandomized approximation
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings, Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations, The Computational Complexity of the Tutte Plane: the Bipartite Case, On the number of Eulerian orientations of a graph, Unnamed Item, The computational complexity of generating random fractals, The hierarchical parity model, Eulerian digraphs and toric Calabi-Yau varieties, A strong log-concavity property for measures on Boolean algebras, Counting over non-planar graphs, On the unimodality of the independent set numbers of a class of matroids, Propriety conditions for the Bayesian autologistic model-inference for histone modifications, Matrix permanent and quantum entanglement of permutation invariant states, Approximating the number of monomer-dimer coverings of a lattice., The computational complexity of knot and matroid polynomials, Computational complexity of loss networks
