Papers
Topics
Authors
Recent
Search
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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.