Conceptio
›
Archive
›
arXiv (All)
arXiv (All)
open access
The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$
Huang, Yuan et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗
Direct PDF ↓
computational-complexity
computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record
· ID 998725
Retrieved via
Conceptio
— every document is proof-bundled with source, license, and retrieval metadata.