Approximating the permanent of graphs with large factors (Q1199692): Difference between revisions

@@ Property / cites work @@
+Improved Time Bounds for the Maximum Flow Problem
@@ Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
+Normal rank
@@ Property / cites work @@
+Eigenvalues and expanders
@@ Property / cites work: Eigenvalues and expanders / rank @@
+Normal rank
@@ Property / cites work @@
+Q5614192
@@ Property / cites work: Q5614192 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
+Normal rank
@@ Property / cites work @@
+Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+A Monte-Carlo Algorithm for Estimating the Permanent
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate counting, uniform generation and rapidly mixing Markov chains
+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 @@
+Monte-Carlo approximation algorithms for enumeration problems
+Normal rank