scientific article
From MaRDI portal
Publication:2934720
zbMath1302.05187arXivmath/0606143MaRDI QIDQ2934720
No author found.
Publication date: 18 December 2014
Full work available at URL: https://arxiv.org/abs/math/0606143
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (11)
Spatial mixing and the connective constant: optimal bounds ⋮ Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs ⋮ Correlation decay and deterministic FPTAS for counting colorings of a graph ⋮ Unnamed Item ⋮ A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ Approximate Counting via Correlation Decay in Spin Systems ⋮ An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes ⋮ Sequential cavity method for computing free energy and surface pressure ⋮ Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
This page was built for publication:
