Skip to content
Log in
Sponsored AI Networking Cookbook: Practical recipes for AI-assisted network automation and development AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
Preprint

A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems

Cheng-Hua Liu Bo-Ning Meng Ju-Qiu Wang
Sep 2026 · 0 citations
Computer Science

Abstract

We prove a complexity dichotomy for Boolean Holant problems defined by arbitrary finite sets of algebraic complex-valued signatures. The tractable cases are characterized by an explicit, decidable criterion.

arXiv Semantic Scholar
View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.