Author:
Cai Jin-Yi,Lu Pinyan,Xia Mingji
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference28 articles.
1. Holant problems and counting CSP;Cai,2009
2. The complexity of enumeration and reliability problems;Valiant;SIAM J. Comput.,1979
3. Complexity of generalized satisfiability counting problems;Creignou;Inf. Comput.,1996
4. The complexity of counting graph homomorphisms;Dyer,2000
5. On counting homomorphisms to directed acyclic graphs;Dyer;J. ACM,2007
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献