A Dichotomy for Real Boolean Holant Problems

no code implementations • 16 May 2020 • Shuai Shao, Jin-Yi Cai

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions.

Computational Complexity

On a Theorem of Lovász that $\hom(\cdot, H)$ Determines the Isomorphism Type of $H$

no code implementations • 9 Sep 2019 • Jin-Yi Cai, Artem Govorov

In this paper we prove a general form of this theorem where H can have arbitrary vertex and edge weights.

Discrete Mathematics Combinatorics