A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs

Tomoyuki Yamakami. A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs. Theoretical Computer Science, 447:120-135, 2012. [doi]

Abstract

Abstract is missing.