Pages that link to "Item:Q5850764"
From MaRDI portal
The following pages link to An algorithmic proof of Brégman–Minc theorem (Q5850764):
Displaying 6 items.
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
- On Leonid Gurvits’s Proof for Permanents (Q3069248) (← links)
- A note on some upper bounds for permanents of (0, 1)-matrices (Q3622685) (← links)
- Extending the minc-brègman upper bound for the permanent (Q4485089) (← links)
- An entropy proof of Bregman's theorem (Q5961543) (← links)