Computing permanents of complex diagonally dominant matrices and tensors

DOI10.1007/s11856-019-1896-0OpenAlexW2964116399WikidataQ114221636 ScholiaQ114221636MaRDI QIDQ2317703

Alexander I. Barvinok

Publication date: 12 August 2019

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.04191

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Basic linear algebra (15Axx) Computer aspects of numerical algorithms (65Yxx)

Related Items

Zeros and approximations of holant polynomials on the complex plane, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Weighted counting of solutions to sparse systems of equations, A Tight Analysis of Bethe Approximation for Permanent

Cites Work

• Computing the permanent of (some) complex matrices
• Combinatorics and complexity of partition functions
• Relations among the minors of a matrix with dominant principal diagonal
• Inequalities for the permanent function
• On a conjecture of Sokal concerning roots of the independence polynomial
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• Approximating permanents and hafnians
• A Tight Analysis of Bethe Approximation for Permanent
• Weighted counting of solutions to sparse systems of equations