Computing permanents of complex diagonally dominant matrices and tensors (Q2317703): Difference between revisions

@@ Property / cites work @@
+A Tight Analysis of Bethe Approximation for Permanent
+Normal rank
@@ Property / cites work @@
+Computing the permanent of (some) complex matrices
+Normal rank
@@ Property / cites work @@
+Combinatorics and complexity of partition functions
+Normal rank
@@ Property / cites work @@
+Approximating permanents and hafnians
@@ Property / cites work: Approximating permanents and hafnians / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted counting of solutions to sparse systems of equations
+Normal rank
@@ Property / cites work @@
+Relations among the minors of a matrix with dominant principal diagonal
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
+Normal rank
@@ Property / cites work @@
+Inequalities for the permanent function
@@ Property / cites work: Inequalities for the permanent function / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
+Normal rank
@@ Property / cites work @@
+On a conjecture of Sokal concerning roots of the independence polynomial
+Normal rank