7 citations · 17 across the 14 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016★ 7 cited
The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
Jiabao Lin, Hanpin Wang
Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain wi…
cs.CC2015
Making problems tractable on big data via preprocessing with polylog-size output
Jiannan Yang, Hanpin Wang, Yongzhi Cao
To provide a dichotomy between those queries that can be made feasible on big data after appropriate preprocessing and those for which preprocessing does not help, Fan et al. devel…