Hanpin Wang

1. The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
   2016/11/03 by Jiabao Lin, Hanpin Wang, Lin, Jiabao +1 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods
2. Differentially Private Condorcet Voting
   2022/06/27 by Zhechen Li, Ao Liu, Li, Zhechen +7 · 1 citation
   Computer Science · Economics, Econometrics and Finance · #Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Voting Systems #Internet Traffic Analysis and Secure E-voting #Privacy-Preserving Technologies in Data