Comparison of permanental bounds of \((0,1)\)-matrices

DOI10.1016/S0166-218X(98)00008-0zbMath0907.15006OpenAlexW2092586550MaRDI QIDQ1392571

Suk-Geun Hwang, Kräuter, Arnold Richard

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

integer matrix\((0,1)\)-matrixpermanent inequalityfully indecomposable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
• A graph theoretic upper bound on the permanent of a nonnegative integer matrix. II. The extremal case
• Inequalities for the gamma function with applications to permanents
• An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix
• Theory of permanents 1982–1985
• Permanents
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• Some Inequalities involving (r!)^1/r

This page was built for publication: Comparison of permanental bounds of \((0,1)\)-matrices