Dichotomy result on 3-regular bipartite non-negative functions

Dichotomy result on 3-regular bipartite non-negative functions

We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function f=[x0,x1,x2,x3], we prove that the bipartite Holant problem Holant(f|(=3)) is either computable in polynomial time or #P-hard. T...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2023-03, Vol.949, p.113745, Article 113745
Hauptverfasser: Fan, Austen Z., Cai, Jin-Yi
Format: Artikel
Sprache:eng
Schlagworte:
Bipartite graph
Dichotomy theorem
Holant problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function f=[x0,x1,x2,x3], we prove that the bipartite Holant problem Holant(f|(=3)) is either computable in polynomial time or #P-hard. The dichotomy criterion on f is explicit.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2023.113745