Restricted Holant Dichotomy on Domains 3 and 4
Abstract
Holant*(f) denotes a class of counting problems specified by a constraint function f. We prove complexity dichotomy theorems for 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.