scientific article
From MaRDI portal
Publication:2908853
DOI10.4230/LIPIcs.FSTTCS.2010.240zbMath1245.68092MaRDI QIDQ2908853
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_81bd.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region ⋮ Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard ⋮ Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard ⋮ Rapid mixing of Swendsen–Wang dynamics in two dimensions
This page was built for publication:
