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

Cambridge University Press eBooks

Fibonacci Gates and Holant* Problems

Jin‐Yi Cai, Xi Chen

Published Nov 28, 2017• 0 citations
Publisher
DOI
10.1017/9781107477063.003

Related papers

Dichotomy for Holant∗ Problems on the Boolean Domain

Jin‐Yi Cai, Pinyan Lu, Mingji Xia

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

Zero-freeness and approximation of real Boolean Holant problems

Zonglei Bai, Yongzhi Cao, Hanpin Wang

Theoretical Computer Science•Mar 15, 2022•1 citation

FPTAS for Weighted Fibonacci Gates and Its Applications

Pinyan Lu, Menghui Wang, Chihao Zhang

arXiv:1402.4370•Lecture notes in computer science•Jan 1, 2014•11 citations

The computational complexity of Holant problems on 3-regular graphs

Peng Yang, Yuan Huang, Zhiguo Fu

Theoretical Computer Science•Oct 17, 2023•1 citation

From Holant to #CSP and Back: Dichotomy for Holant c Problems

Jin‐Yi Cai, Sangxia Huang, Pinyan Lu

Lecture notes in computer science•Jan 1, 2010•18 citations

Clifford gates in the Holant framework

Jin‐Yi Cai, Heng Guo, Tyson Williams

arXiv:1705.00942•Theoretical Computer Science•Jun 7, 2018•7 citations