Author:
Cai Jin-Yi,Fu Zhiguo,Girstmair Kurt,Kowalczyk Michael
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference34 articles.
1. Miriam Backens (2017). A New Holant Dichotomy Inspired by Quantum
Computation. In 44th International Colloquium on Automata, Languages, and Programming, volume 80, 16:1-16:14.
2. Rodney J Baxter (1982). Exactly solved models in statistical mechanics.
Academic Press London.
3. Andrei A Bulatov (2013). The complexity of the counting constraint
satisfaction problem. Journal of the ACM (JACM) 60(5), 1-41.
4. Andrei A Bulatov, Martin Dyer, Leslie Ann Goldberg, Mark
Jerrum & Colin McQuillan (2013). The expressibility of functions on the boolean domain, with applications to counting CSPs. Journal of
the ACM (JACM) 60(5), 1-36.
5. Jin-Yi Cai & Xi Chen (2017). Complexity of counting CSP with
complex weights. Journal of the ACM (JACM) 64(3), 1-39.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献