1. N. Anari, L. Gurvits, S.O. Gharan and A. Saberi, Simply exponential approximation of the permanent of positive semidefinite matrices, in 58th Annual IEEE Symposium on Foundations of Computer Science—FOCS 2017, IEEE Computer Society, Los Alamitos, CA, 2017, pp. 914–925.
2. N. Anari and A. Rezaei, A tight analysis of Bethe approximation for permanent, preprint arXiv:1811.02933.
3. A. Barvinok, Computing the permanent of (some) complex matrices, Foundations of Computational Mathematics 16 (2016), 329–342.
4. A. Barvinok, Combinatorics and Complexity of Partition Functions, Algorithms and Combinatorics, Vol. 30, Springer, Cham, 2016.
5. A. Barvinok, Approximating permanents and hafnians, Discrete Analysis (2017), Paper No. 2.