Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Bulatov, A.A., Dalmau, V.: Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. Information and Computation 205(5), 651–678 (2007)
2. Bulatov, A.A., Grohe, M.: The Complexity of Partition Functions. Theoretical Computer Science 348(2-3), 148–186 (2005)
3. Cai, J.-Y., Lu, P.: Holographic Algorithms: From Art to Science. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 401–410. ACM Press, New York (2007)
4. Cai, J.-Y., Lu, P.: On Symmetric Signatures in Holographic Algorithms. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 429–440. Springer, Heidelberg (2007)
5. Cai, J.-Y., Chen, X., Lu, P.: Graph Homomorphisms with Complex Values: A Dichotomy Theorem. Computing Research Repository, arXiv:0903.4728v1 (2009)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献