Dichotomy for Holant∗ Problems on the Boolean Domain-Reference-Cited by-同舟云学术

Dichotomy for Holant∗ Problems on the Boolean Domain

Published:2020-06-22 Issue:8 Volume:64 Page:1362-1391
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Cai Jin-Yi,Lu Pinyan,Xia Mingji

Funder

National Science Foundation

Science and Technology Innovation 2030

National Natural Science Foundation of China

Key Programme

Science and Technology Innovative Research Team in Higher Educational Institutions of Hunan Province

Fundamental Research Funds for the Central Universities

Youth Innovation Promotion Association of the Chinese Academy of Sciences

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00224-020-09983-8.pdf

Reference52 articles.

1. Backens, M.: A New Holant Dichotomy Inspired by Quantum Computation. In: 44Th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, pp. 16:1–16:14 (2017)

2. Backens, M.: A Complete Dichotomy for Complex-Valued Holantc. In: 45Th International Colloquium on Automata, Languages, and Programming, ICALP 2018, pp. 12:1–12:14 (2018)

3. Baxter, R. J.: Exactly solved models in statistical mechanics. Academic Press, London (1982)

4. Bulatov, A. A.: The complexity of the counting constraint satisfaction problem. J. ACM 60(5), 34:1–34:41 (2013)

5. Bulatov, A. A., Dyer, M. E., Goldberg, L. A., Jalsenius, M., Jerrum, M., Richerby, D.: The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2), 681–688 (2012)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complexity classification of the eight-vertex model;Information and Computation;2023-08

2. FKT is Not Universal — A Planar Holant Dichotomy for Symmetric Constraints;Theory of Computing Systems;2021-08-09