arXiv (All)
open access
A Full Complexity Dichotomy for Complex-Valued Boolean Holant Problems
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Dichotomy for Complex Boolean Holant with Binary Disequality#819682
- A Dichotomy for Complex Boolean Holant with Binary Disequality#809686
- A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets#1070625
- Introduction to Complex Automata using Cook Algebra#110998
- Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points#1013523
Record · ID 1154704
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive