Pages that link to "Item:Q1418984"
From MaRDI portal
The following pages link to An upper bound for the permanent of \((0,1)\)-matrices. (Q1418984):
Displaying 13 items.
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- Upper bounds on the permanent of multidimensional \((0,1)\)-matrices (Q892073) (← links)
- A comparison of two upper bounds on the permanent of \((0,1)\)-matrices (Q1380706) (← links)
- Extremes of permanents of \((0,1)\)-matrices. (Q1414140) (← links)
- Kräuter conjecture on permanents is true (Q1633378) (← links)
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- On the number of Sudoku squares (Q1783641) (← links)
- An upper bound for permanents of nonnegative matrices (Q2474496) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- (Q3025281) (← links)
- A note on some upper bounds for permanents of (0, 1)-matrices (Q3622685) (← links)
- An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix (Q3752525) (← links)
- An algorithmic proof of Brégman–Minc theorem (Q5850764) (← links)
