Some upper bounds for permanents of (0, 1)-matrices
From MaRDI portal
Publication:3511473
DOI10.1080/09720502.2007.10700483zbMath1175.05026OpenAlexW2328317811MaRDI QIDQ3511473
Publication date: 11 July 2008
Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720502.2007.10700483
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A permanent formula with many zero-valued terms
- The complexity of computing the permanent
- A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
- Permanents in probability and statistics
- Maximum permanents on certain classes of nonnegative matrices
- On the random generation and counting of matchings in dense graphs
- A note on the permanent value problem
- On the hardness of computing the permanent of random matrices
- An upper bound for the permanent of a nonnegative matrix
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices