Restricted Holant Dichotomy on Domains 3 and 4
Computational Complexity
2023-08-01 v1
Abstract
denotes a class of counting problems specified by a constraint function . We prove complexity dichotomy theorems for in two settings: (1) is any arity-3 real-valued function on input of domain size 3. (2) is any arity-3 -valued function on input of domain size 4.
Keywords
Cite
@article{arxiv.2307.16078,
title = {Restricted Holant Dichotomy on Domains 3 and 4},
author = {Yin Liu and Austen Z. Fan and Jin-Yi Cai},
journal= {arXiv preprint arXiv:2307.16078},
year = {2023}
}