Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Theoretical Computer Science

The computational complexity of Holant problems on 3-regular graphs

Peng Yang, Yuan Huang, Zhiguo Fu

Published Oct 17, 2023• 1 citation
Publisher
DOI
10.1016/j.tcs.2023.114256

Related papers

Holant Problems for 3-Regular Graphs with Complex Edge Functions

Michael Kowalczyk, Jin‐Yi Cai

Theory of Computing Systems•Mar 22, 2016•20 citations

Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs

Junda Li, Yuan Huang, Yanlin Zheng

Theory of Computing Systems•Jan 15, 2025•0 citations

Zero-freeness and approximation of real Boolean Holant problems

Zonglei Bai, Yongzhi Cao, Hanpin Wang

Theoretical Computer Science•Mar 15, 2022•1 citation

Dichotomy for Holant∗ Problems on the Boolean Domain

Jin‐Yi Cai, Pinyan Lu, Mingji Xia

Theory of Computing Systems•Jun 22, 2020•6 citations

Holant Problems for Regular Graphs with Complex Edge Functions

Michael Kowalczyk, Jin‐Yi Cai

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets in combination succeed in proving #P-hardness; and (3) algebraic symmetrization, which significantly lowers the symbolic complexity of the proof for computational complexity. With holographic reductions the classification theorem also applies to problems beyond the basic model.

arXiv:1001.0464•Jan 4, 2010•15 citations

Fibonacci Gates and Holant* Problems

Jin‐Yi Cai, Xi Chen

Cambridge University Press eBooks•Nov 28, 2017•0 citations
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets in combination succeed in proving #P-hardness; and (3) algebraic symmetrization, which significantly lowers the symbolic complexity of the proof for computational complexity. With holographic reductions the classification theorem also applies to problems beyond the basic model.