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žené v:

Podrobná bibliografia
Vydané v:	Theory of computing systems Ročník 64; číslo 8; s. 1362 - 1391
Hlavní autori:	Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2020 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!