Dichotomy for Holant∗ Problems on the Boolean Domain

Holant problems are a general framework to study counting problems. Both counting constraint satisfaction problems (#CSP) and graph homomorphisms are special cases. We prove a complexity dichotomy theorem for Holant ∗ ( F ) , where F is a set of constraint functions on Boolean variables and taking c...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 64; no. 8; pp. 1362 - 1391
Main Authors:	Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2020 Springer Nature B.V
Subjects:	Algorithms Boolean Boolean algebra Complex variables Complexity Computer Science Homomorphisms Polynomials Theorems Theory of Computation P-hardness Constraint satisfaction problems Dichotomy theorems Edge coloring models Holant problems Polynomial time algorithms
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!