An upper bound for the permanent of \((0,1)\)-matrices.

DOI10.1016/j.laa.2003.09.003zbMath1043.15015OpenAlexW2094555811MaRDI QIDQ1418984

Heng Liang, Feng-Shan Bai

Publication date: 14 January 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.09.003

zbMATH Keywords

(0,1)-matrixUpper boundPermanentUnbiased estimator

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45) Matrices of integers (15B36)

Related Items (6)

Random path method with pivoting for computing permanents of matrices ⋮ Permanents of almost regular complete bipartite graphs ⋮ An update on Minc's survey of open problems involving permanents ⋮ On the number of Sudoku squares ⋮ A note on some upper bounds for permanents of (0, 1)-matrices ⋮ An algorithmic proof of Brégman–Minc theorem

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Approximating the permanent: A simple approach
• Permanents
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: An upper bound for the permanent of \((0,1)\)-matrices.