Intl. Colloquium on Automata, Languages, and Programming, ICALP 2017


Article Details
Title: The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights
Article URLs:
Alternative Article URLs:
Authors: Jiabao Lin
  • Peking University, Key Laboratory of High Confidence Software Technologies
  • Peking University, School of Electronics Engineering and Computer Science
Hanpin Wang
  • Peking University, Key Laboratory of High Confidence Software Technologies
  • Peking University, School of Electronics Engineering and Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icalp/LinW17
Author Comments:

Discuss this paper and its artifacts below