Pages that link to "Item:Q4455138"
From MaRDI portal
The following pages link to New permanental upper bounds for nonnegative matrices (Q4455138):
Displaying 17 items.
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- Concentration of the mixed discriminant of well-conditioned matrices (Q905709) (← links)
- A relationship between subpermanents and the arithmetic-geometric mean inequality (Q958001) (← links)
- Permanental bounds for nonnegative matrices via decomposition (Q1765888) (← links)
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) (Q1926033) (← links)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- A general law of large permanent (Q2362303) (← links)
- An upper bound for permanents of nonnegative matrices (Q2474496) (← links)
- An update on Minc's survey of open problems involving permanents (Q2484497) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs (Q3082859) (← links)
- Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630) (← links)
- A note on some upper bounds for permanents of (0, 1)-matrices (Q3622685) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
