Some Problems on Approximate Counting in Graphs and Matroids (Q2971623): Difference between revisions

@@ Property / cites work @@
+Q3858023
@@ Property / cites work: Q3858023 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
+Normal rank
@@ Property / cites work @@
+Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
+Normal rank
@@ Property / cites work @@
+A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
+Normal rank
@@ Property / cites work @@
+Nowhere-zero 6-flows
@@ Property / cites work: Nowhere-zero 6-flows / rank @@
+Normal rank
@@ Property / cites work @@
+A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
+Normal rank
@@ Property / cites work @@
+Q4386297
@@ Property / cites work: Q4386297 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Permanent
@@ Property / cites work: Approximating the Permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Algorithms for the Ising Model
+Normal rank
@@ Property / cites work @@
+Improved bounds for sampling colorings
@@ Property / cites work: Improved bounds for sampling colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Q3976407
@@ Property / cites work: Q3976407 / rank @@
+Normal rank
@@ Property / cites work @@
+On the problem of approximating the number of bases of a matroid
+Normal rank
@@ Property / cites work @@
+Counting trees in a graph is \(\# \text{P}\)-complete
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
+Normal rank
@@ Property / cites work @@
+Q3447279
@@ Property / cites work: Q3447279 / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
+Normal rank
@@ Property / cites work @@
+Fast uniform generation of regular graphs
@@ Property / cites work: Fast uniform generation of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial applications of an inequality from statistical mechanics
+Normal rank
@@ Property / cites work @@
+Approximate counting, uniform generation and rapidly mixing Markov chains
+Normal rank
@@ Property / cites work @@
+The computational complexity of matroid properties
+Normal rank
@@ Property / cites work @@
+Planar graph coloring is not self-reducible, assuming P\(\neq NP\)
+Normal rank
@@ Property / cites work @@
+On the computational complexity of the Jones and Tutte polynomials
+Normal rank
@@ Property / cites work @@
+Q3447284
@@ Property / cites work: Q3447284 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140234
@@ Property / cites work: Q3140234 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717856
@@ Property / cites work: Q4717856 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of the Tutte polynomial
@@ Property / cites work: Inapproximability of the Tutte polynomial / rank @@
+Normal rank