Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630): Difference between revisions

@@ Property / cites work @@
+A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
+Normal rank
@@ Property / cites work @@
+Exponentially many perfect matchings in cubic graphs
+Normal rank
@@ Property / cites work @@
+The solution of van der Waerden's problem for permanents
+Normal rank
@@ Property / cites work @@
+Concentration of permanent estimators for certain large matrices.
+Normal rank
@@ Property / cites work @@
+Permanents of d-dimensional matrices
@@ Property / cites work: Permanents of d-dimensional matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Positive diagonal scaling of a nonnegative tensor to one with prescribed slice sums
+Normal rank
@@ Property / cites work @@
+Concentration of Random Determinants and Permanent Estimators
+Normal rank
@@ Property / cites work @@
+The number of \(t\)-wise balanced designs
@@ Property / cites work: The number of \(t\)-wise balanced designs / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
+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 @@
+New permanental upper bounds for nonnegative matrices
+Normal rank
@@ Property / cites work @@
+A short proof of Minc's conjecture
@@ Property / cites work: A short proof of Minc's conjecture / rank @@
+Normal rank