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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 64; číslo 8; s. 1362 - 1391
Hlavní autoři: Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.11.2020
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 complex values. The constraint functions need not be symmetric functions. We identify four classes of problems which are polynomial time computable; all other problems are proved to be #P-hard. The main proof technique and indeed the formulation of the theorem use holographic algorithms and reductions. By considering these counting problems with the broader scope that allows complex-valued constraint functions, we discover surprising new tractable classes, which are associated with isotropic vectors, i.e., a (non-zero) vector whose dot product with itself is zero.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-020-09983-8