A complexity dichotomy for hypergraph partition functions

Computational Complexity

Volumn 19, Issue 4, 2010, Pages 605-633

  Dyer, Martin ^a   Goldberg, Leslie Ann ^b   Jerrum, Mark ^c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Dichotomy; Hypergraph; Partition functions

Indexed keywords

EID: 78650206377     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-010-0300-6     Document Type: Article

References (14)

1. C. Berge (1970). Graphes et Hypergraphes. Dunod, Paris, xviii, 502 p.
2. A. Bulatov & M. Grohe (2005). The complexity of partition functions. Theoretical Computer Science 348, 148-186.
3. A. Bulatov, M. Dyer, L. A. Goldberg & M. Jerrum (2009). Personal communication.
4. A. A. Bulatov (2008). The complexity of the counting constraint satisfaction problem. In ICALP (1), 646-661.
5. A. A. Bulatov & V. Dalmau (2007). Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205(5), 651-678.
6. H. Cohen (1993). A Course in Computational Algebraic Number Theory. SpringerVerlag New York Inc., New York, NY, USA. ISBN 0-387-55640-0.
7. K. Denecke & S. L. Wismath (2002). Universal Algebra and Applications in Theoretical Computer Science. CRC/C&H. ISBN 1584882549.
8. P. Diaconis & A. Gangolli (1995). Rectangular arrays with fixed margins. In Discrete Probability and Algorithms (Minneapolis, MN, 1993), volume 72 of IMA Vol. Math. Appl., 15-41. Springer, New York.
9. M. Dyer & C. Greenhill (2000). The complexity of counting graph homomorphisms. Random Structures and Algorithms 17(3-4), 260-289.
10. M. Dyer, L. A. Goldberg & M. Jerrum (2009). The complexity of weighted boolean CSP. SIAM Journal on Computing 38(5), 1970-1986. URL http://link. aip.org/link/?SMJ/38/1970/1.
11. O. Klíma, B. Larose & P. Tesson (2006). Systems of equations over finite semigroups and the #CSP dichotomy conjecture. In Mathematical Foundations of Computer Science 2006, volume 4162 of Lecture Notes in Comput. Sci., 584-595. Springer, Berlin.
12. C. E. M. C. Lange & Günter M. Ziegler (2007). On generalized Kneser hypergraph colorings. J. Combin. Theory Ser. A 114(1), 159-166. ISSN 0097-3165. URL http://dx.doi.org/10.1016/j.jcta.2006.02.003.
13. L. Mirsky (1990). An Introduction to Linear Algebra. Dover Publications Inc., New York. ISBN 0-486-66434-1, viii+440. Reprint of the 1972 edition.
14. P. P. Pálfy (1984). Unary polynomials in algebras. I. Algebra Universalis 18(3), 262-273. ISSN 0002-5240. URL http://dx.doi.org/10.1007/BF01203365.