Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Cai, J., Lu, P.: Holographic algorithms: from arts to science. J. Comput. Syst. Sci. 77, 41–61 (2011)
2. Cai, J., Lu, P., Xia, M.: Holographic algorithms by Fibonacci gates and holographic reductions for hardness. In: Proceedings of FOCS 2008, pp. 644–653 (2008)
3. Cai, J., Lu, P., Xia, M.: Holant problems and counting CSP. In: Proceedings of STOC 2009, pp. 715–724 (2009)
4. Cai, J., Lu, P., Xia, M.: Dichotomy for Holant* problems of Boolean domain,
http://pages.cs.wisc.edu/~jyc/
5. Creignou, N., Hermann, M.: Complexity of generalized satisfiability counting problems. Inf. Comput. 125, 1–12 (1996)