2000 character limit reached
Restricted Holant Dichotomy on Domains 3 and 4
Published 29 Jul 2023 in cs.CC | (2307.16078v1)
Abstract: $\operatorname{Holant}*(f)$ denotes a class of counting problems specified by a constraint function $f$. We prove complexity dichotomy theorems for $\operatorname{Holant}*(f)$ in two settings: (1) $f$ is any arity-3 real-valued function on input of domain size 3. (2) $f$ is any arity-3 ${0,1}$-valued function on input of domain size 4.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.