On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Complexity of generalized satisfiability counting problems
Information and Computation
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The complexity of counting graph homomorphisms
Proceedings of the ninth international conference on on Random structures and algorithms
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
SIAM Journal on Computing
Simulating Quantum Computation by Contracting Tensor Networks
SIAM Journal on Computing
The Complexity of the Counting Constraint Satisfaction Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Complexity of Weighted Boolean CSP
SIAM Journal on Computing
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Holographic algorithms: From art to science
Journal of Computer and System Sciences
A Complexity Dichotomy for Partition Functions with Mixed Signs
SIAM Journal on Computing
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Codes on graphs: normal realizations
IEEE Transactions on Information Theory
A Dichotomy for Real Weighted Holant Problems
CCC '12 Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)
Spin systems on k-regular graphs with complex edge functions
Theoretical Computer Science
The complexity of planar boolean #CSP with complex weights
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions {F} on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric constraint functions (taking values without a finite modulus). We define and characterize all symmetric vanishing signatures. They turned out to be essential to the complete classification of Holant problems. The dichotomy theorem has an explicit tractability criterion. A Holant problem defined by a set of constraint functions {F} is solvable in polynomial time if it satisfies this tractability criterion, and is #P-hard otherwise. The tractability criterion can be intuitively stated as follows: A set {F} is tractable if (1) every function in {F} has arity at most two, or (2) {F} is transformable to an affine type, or (3) {F} is transformable to a product type, or (4) {F} is vanishing, combined with the right type of binary functions, or (5) {F} belongs to a special category of vanishing type Fibonacci gates. The proof of this theorem utilizes many previous dichotomy theorems on Holant problems and Boolean #CSP. Holographic transformations play an indispensable role, not only as a proof technique, but also in the statement of the dichotomy criterion.