An algorithmic proof of Brégman–Minc theorem

DOI10.1080/00207160802441264zbMath1179.15009OpenAlexW2021952172MaRDI QIDQ5850764

Heng Liang, Li Xu, Feng-Shan Bai

Publication date: 15 January 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802441264

zbMATH Keywords

algorithmupper boundpermanent(0,1)-matrix

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45)

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• A short proof of Minc's conjecture
• Approximating the permanent via importance sampling with application to the dimer covering problem
• An upper bound for the permanent of \((0,1)\)-matrices.
• Concentration of permanent estimators for certain large matrices.
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• A Monte-Carlo Algorithm for Estimating the Permanent
• Approximating the permanent: A simple approach
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
• An entropy proof of Bregman's theorem

This page was built for publication: An algorithmic proof of Brégman–Minc theorem