1. A. Bandyopadhyay, D. Gamarnik, Counting without sampling: asymptotics of the log-partition function for certain statistical physics models. Random Struct. Algorithm 33(4), 452–479 (2008)
2. B. Barak, A. Moitra, R. O’Donnell, P. Raghavendra, O. Regev, D. Steurer, L. Trevisan, A. Vijayaraghavan, D. Witmer, J. Wright, Beating the random assignment on constraint satisfaction problems of bounded degree, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. LIPIcs. Leibniz International Proceedings in Informatics, vol. 40 (Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015), pp. 110–123
3. A. Barvinok, Computing the partition function for cliques in a graph. Theor. Comput. 11, Article 13, 339–355 (2015)
4. A. Barvinok, Computing the permanent of (some) complex matrices. Found. Comput. Math. 16(2), 329–342 (2016)
5. A. Barvinok, P. Soberón, Computing the partition function for graph homomorphisms. Combinatorica (2016). doi:
10.1007/s00493-016-3357-2