Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Fan, A. Z., & Cai, J. Y. (2021). Dichotomy Result on 3-Regular Bipartite Non-negative Functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12730 LNCS, pp. 102–115). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-79416-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
