The complexity of approximating conservative counting CSPs.
From MaRDI portal
Publication:2957879
DOI10.4230/LIPIcs.STACS.2013.148zbMath1354.68115OpenAlexW2518351639MaRDI QIDQ2957879
Colin McQuillan, Pinyan Lu, Martin Dyer, David Richerby, Xi Chen, Leslie Ann Goldberg, Mark R. Jerrum
Publication date: 30 January 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2013.148
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region ⋮ Unnamed Item ⋮ Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
This page was built for publication: The complexity of approximating conservative counting CSPs.
