We prove a complexity dichotomy theorem for a class of Holant problems on3-regular bipartite graphs . Thedichotomy criterion on $f$ is explicit . We prove that the problem is either computable in polynomial time or is hard .

Author(s) : Austen Z. Fan, Jin-Yi Cai

Links : PDF - Abstract

Code :


Keywords : dichotomy - regular - bipartite - prove - -

Leave a Reply

Your email address will not be published. Required fields are marked *