On the complexity of #CSP
From MaRDI portal
Publication:2875200
DOI10.1145/1806689.1806789zbMath1293.68165OpenAlexW2058673868WikidataQ56323830 ScholiaQ56323830MaRDI QIDQ2875200
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806789
Related Items
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems, Holographic reduction, interpolation and hardness, The complexity of complex weighted Boolean \#CSP, The complexity of weighted counting for acyclic conjunctive queries, Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits, The complexity of weighted and unweighted \(\#\)CSP, Progress in Complexity of Counting Problems, On Maltsev Digraphs, Spin systems on \(k\)-regular graphs with complex edge functions, On Maltsev digraphs, Dichotomy for Holant\(^\ast\) problems on the Boolean domain, A Complete Dichotomy Rises from the Capture of Vanishing Signatures, Approximate Counting via Correlation Decay in Spin Systems, A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights, A dichotomy for real weighted Holant problems
