Pages that link to "Item:Q414468"
From MaRDI portal
The following pages link to Correlation decay and deterministic FPTAS for counting colorings of a graph (Q414468):
Displaying 12 items.
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
- Uniqueness for the 3-state antiferromagnetic Potts model on the tree (Q1990212) (← links)
- On a conjecture of Sokal concerning roots of the independence polynomial (Q2286792) (← links)
- Uniqueness of Gibbs measures for continuous hardcore models (Q2327937) (← links)
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
- Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs (Q5026395) (← links)
- Strong spatial mixing of list coloring of graphs (Q5265338) (← links)
- Strong spatial mixing in homomorphism spaces (Q5361232) (← links)
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs (Q5875490) (← links)
- Correlation decay and the absence of zeros property of partition functions (Q6077053) (← links)
- Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \) (Q6081416) (← links)
