The complexity of partition functions
Authors:
- Andrei BulatovABAndrei Bulatov
- Martin GroheMGMartin Grohe
- 1 December 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 348 (2-3) , 148-186
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The computational complexity of two‐state spin systemsRandom Structures & Algorithms, 2003
- Counting and Sampling H-Colourings2002
- The complexity of counting graph homomorphismsRandom Structures & Algorithms, 2000
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM Journal on Computing, 1998
- Closure properties of constraintsJournal of the ACM, 1997
- Duality and Polynomial Testing of Tree HomomorphismsTransactions of the American Mathematical Society, 1996
- Complexity of Generalized Satisfiability Counting ProblemsInformation and Computation, 1996
- On the computational complexity of the Jones and Tutte polynomialsMathematical Proceedings of the Cambridge Philosophical Society, 1990
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990