The computational complexity of Holant problems on 3-regular graphs

被引：0
|
作者：
Yang, Peng [1 ,2 ]
Huang, Yuan [1 ,2 ]
Fu, Zhiguo [1 ,2 ]
机构：
[1] Northeast Normal Univ, Sch Informat Sci & Technol, Changchun 130117, Peoples R China
[2] Northeast Normal Univ, KLAS, Changchun 130117, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2024年 / 982卷
基金：
中国国家自然科学基金;
关键词：
Holant problems; Computational complexity; Dichotomy; SLOCC; HOLOGRAPHIC ALGORITHMS; DICHOTOMY;
D O I：
10.1016/j.tcs.2023.114256
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Holant problem is a framework to study counting problems, which is expressive enough to contain Counting Graph Homomorphisms (#GH) and Counting Constraint Satisfaction Problems (#CSP) as special cases. In the present paper, we classify the computational complexity of Holant problems on 3-regular graphs, where the signature is complex valued and not necessarily symmetric. In details, we prove that Holant problem on 3-regular graphs is #P-hard except for the signature is not genuinely entangled, A-transformable, P-transformable or vanishing, in which cases the problem is tractable.
引用
收藏
页数：13
相关论文
共 50 条
  • [1] Holant Problems for 3-Regular Graphs with Complex Edge Functions
    Kowalczyk, Michael
    Cai, Jin-Yi
    THEORY OF COMPUTING SYSTEMS, 2016, 59 (01) : 133 - 158
  • [2] Holant Problems for 3-Regular Graphs with Complex Edge Functions
    Michael Kowalczyk
    Jin-Yi Cai
    Theory of Computing Systems, 2016, 59 : 133 - 158
  • [3] Computational complexity of counting problems on 3-regular planar graphs
    Xia, Mingji
    Zhang, Peng
    Zhao, Wenbo
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (01) : 111 - 125
  • [4] Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs
    Li, Junda
    Huang, Yuan
    Zheng, Yanlin
    THEORY OF COMPUTING SYSTEMS, 2025, 69 (01)
  • [5] COMPUTATIONAL COMPLEXITY OF HOLANT PROBLEMS
    Cai, Jin-Yi
    Lu, Pinyan
    Xia, Mingji
    SIAM JOURNAL ON COMPUTING, 2011, 40 (04) : 1101 - 1132
  • [6] HOLANT PROBLEMS FOR REGULAR GRAPHS WITH COMPLEX EDGE FUNCTIONS
    Kowalczyk, Michael
    Cai, Jin-Yi
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 525 - 536
  • [7] 3-REGULAR PATH PAIRABLE GRAPHS
    FAUDREE, RJ
    GYARFAS, A
    LEHEL, J
    GRAPHS AND COMBINATORICS, 1992, 8 (01) : 45 - 52
  • [8] An identity involving 3-regular graphs
    Woodall, DR
    DISCRETE MATHEMATICS, 1996, 152 (1-3) : 287 - 293
  • [9] 3-REGULAR PARTS OF 4-REGULAR GRAPHS
    TASHKINOV, VA
    MATHEMATICAL NOTES, 1984, 36 (1-2) : 612 - 623
  • [10] On Rewriting of Planar 3-Regular Graphs
    Tomita, Kohji
    Ikeda, Yasuwo
    Hosono, Chiharu
    INFORMATICS ENGINEERING AND INFORMATION SCIENCE, PT III, 2011, 253 : 346 - +
12345