Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2014.06.040
@@ Property / DOI: 10.1016/j.tcs.2014.06.040 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3549606
@@ Property / cites work: Q3549606 / rank @@
+Normal rank
@@ Property / cites work @@
+The statistical mechanics of strategic interaction
+Normal rank
@@ Property / cites work @@
+Lower bounds for sampling algorithms for estimating the average
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Spanning Tree Weight in Sublinear Time
+Normal rank
@@ Property / cites work @@
+Q3396583
@@ Property / cites work: Q3396583 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
+Normal rank
@@ Property / cites work @@
+Q2934720
@@ Property / cites work: Q2934720 / rank @@
+Normal rank
@@ Property / cites work @@
+A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
+Normal rank
@@ Property / cites work @@
+Matchings and walks in graphs
@@ Property / cites work: Matchings and walks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating average parameters of graphs
@@ Property / cites work: Approximating average parameters of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Stars and Other Small Subgraphs in Sublinear-Time
+Normal rank
@@ Property / cites work @@
+Theory of monomer-dimer systems
@@ Property / cites work: Theory of monomer-dimer systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Random matchings in regular graphs
@@ Property / cites work: Random matchings in regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
+Normal rank
@@ Property / cites work @@
+Approximate Counting via Correlation Decay in Spin Systems
+Normal rank
@@ Property / cites work @@
+Correlation Decay up to Uniqueness in Spin Systems
+Normal rank
@@ Property / cites work @@
+Q3395507
@@ Property / cites work: Q3395507 / rank @@
+Normal rank
@@ Property / cites work @@
+Information, Physics, and Computation
@@ Property / cites work: Information, Physics, and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743463
@@ Property / cites work: Q5743463 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
+Normal rank
@@ Property / cites work @@
+Q5491026
@@ Property / cites work: Q5491026 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3135094
@@ Property / cites work: Q3135094 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743449
@@ Property / cites work: Q5743449 / rank @@
+Normal rank
@@ Property / cites work @@
+Lee-Yang theorems and the complexity of computing averages
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+Counting independent sets up to the tree threshold
+Normal rank
@@ Property / cites work @@
+Q3140234
@@ Property / cites work: Q3140234 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved constant-time approximation algorithm for maximum~matchings
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2014.06.040
@@ Property / DOI: 10.1016/J.TCS.2014.06.040 / rank @@
+Normal rank