Pages that link to "Item:Q1250257"
From MaRDI portal
The following pages link to A lower bound for the permanent of a doubly stochastic matrix (Q1250257):
Displaying 12 items.
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134) (← links)
- The Van der Waerden conjecture for mixed discriminants (Q818049) (← links)
- Chebyshev type inequalities involving permanents and their applications (Q869941) (← links)
- Every 7-regular digraph contains an even cycle (Q1123202) (← links)
- On the number of edge-colourings of regular bipartite graphs (Q1166536) (← links)
- Counting 1-factors in regular bipartite graphs (Q1386423) (← links)
- All-even Latin squares (Q1924368) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy (Q3545903) (← links)
- Additive decomposition of nonnegative matrices with applications to permanents and scalingt (Q3784979) (← links)
- An asymptotic solution of the multidimensional dimer problem (Q3867919) (← links)
- The scaling mean and a law of large permanents (Q5965071) (← links)
