A tight analysis of Bethe approximation for permanent
From MaRDI portal
Cites work
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A generalization of permanent inequalities and applications in counting and optimization
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A short proof of Minc's conjecture
- An entropy proof of Bregman's theorem
- Approximating the permanent with fractional belief propagation
- Bounds on the permanent and some applications
- Computing the permanent of (some) complex matrices
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
- Counting 1-factors in regular bipartite graphs
- Efficient profile maximum likelihood for universal symmetric property estimation
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- Lectures on Polytopes
- Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids
- Mathematical Foundations of Computer Science 2005
- Nash social welfare, matrix permanent, and stable polynomials
- Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
- Simply exponential approximation of the permanent of positive semidefinite matrices
- The Bethe Permanent of a Nonnegative Matrix
- The complexity of computing the permanent
- The computational complexity of linear optics
- The sample size required in importance sampling
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
This page was built for publication: A tight analysis of Bethe approximation for permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930371)
