From Holant to #CSP and Back: Dichotomy for Holant c Problems
From MaRDI portal
Publication:3060738
DOI10.1007/978-3-642-17517-6_24zbMath1310.68101OpenAlexW1604555488MaRDI QIDQ3060738
Pinyan Lu, Sangxia Huang, Jin-Yi Cai
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_24
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Holographic reduction, interpolation and hardness ⋮ The complexity of complex weighted Boolean \#CSP ⋮ Holographic reduction for some counting problems ⋮ Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ The Complexity of Symmetric Boolean Parity Holant Problems
This page was built for publication: From Holant to #CSP and Back: Dichotomy for Holant c Problems
