Some upper bounds for permanents of (0, 1)-matrices (Q3511473): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/09720502.2007.10700483
+Normal rank
@@ Property / OpenAlex ID @@
+W2328317811
@@ Property / OpenAlex ID: W2328317811 / rank @@
+Normal rank
@@ Property / cites work @@
+Permanents in probability and statistics
@@ Property / cites work: Permanents in probability and statistics / rank @@
+Normal rank
@@ Property / cites work @@
+A permanent formula with many zero-valued terms
@@ Property / cites work: A permanent formula with many zero-valued terms / rank @@
+Normal rank
@@ Property / cites work @@
+A graph theoretic upper bound on the permanent of a nonnegative integer matrix. I
+Normal rank
@@ Property / cites work @@
+On the hardness of computing the permanent of random matrices
+Normal rank
@@ Property / cites work @@
+Maximum permanents on certain classes of nonnegative matrices
+Normal rank
@@ Property / cites work @@
+An upper bound for the permanent of a nonnegative matrix
+Normal rank
@@ Property / cites work @@
+Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the permanent value problem
@@ Property / cites work: A note on the permanent value problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the random generation and counting of matchings in dense graphs
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002255
@@ Property / cites work: Q4002255 / rank @@
+Normal rank