Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Jiabao Lin, Hanpin Wang. The Complexity of Boolean Holant Problems with Nonnegative Weights. SIAM Journal on Computing, 47(3):798-828, 2018. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Complexity of Holant Problems over Boolean Domain with Non-Negative WeightsJiabao Lin, Hanpin Wang. icalp 2017: [doi] Zero-freeness and approximation of real Boolean Holant problemsZonglei Bai, Yongzhi Cao, Hanpin Wang. TCS, 917:12-30, 2022. [doi]
The following publications are possibly variants of this publication: