scientific article; zbMATH DE number 15994
From MaRDI portal
Publication:3972641
zbMATH Open0737.60094MaRDI QIDQ3972641FDOQ3972641
Publication date: 25 June 1992
Title of this publication is not available (Why is that?)
computational complexitypercolationmonomer-dimer problemrandomized approximationenumeration problems
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (20)
- Propriety conditions for the Bayesian autologistic model-inference for histone modifications
- The computational complexity of knot and matroid polynomials
- The Computational Complexity of the Tutte Plane: the Bipartite Case
- Counting over non-planar graphs
- On the unimodality of the independent set numbers of a class of matroids
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- Approximating the number of monomer-dimer coverings of a lattice.
- Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
- Matrix permanent and quantum entanglement of permutation invariant states
- On the number of Eulerian orientations of a graph
- Title not available (Why is that?)
- The computational complexity of generating random fractals
- Computational complexity of loss networks
- Eulerian digraphs and toric Calabi-Yau varieties
- Title not available (Why is that?)
- Phase transitions and complexity in computer science: An overview of the statistical physics approach to the random satisfiability problem
- Statistical complexity and classical-quantum frontier
- The hierarchical parity model
- Algorithmic information and simplicity in statistical physics
- A strong log-concavity property for measures on Boolean algebras
Recommendations
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)