The following pages link to (Q4798347):
Displayed 36 items.
- On some Tutte polynomial sequences in the square lattice (Q412170) (← links)
- Entropy-driven cutoff phenomena (Q690635) (← links)
- On the approximation of one Markov chain by another (Q818819) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains (Q1769410) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Markov chains, Hamiltonian cycles and volumes of convex bodies (Q1945510) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Efficient importance sampling for binary contingency tables (Q2389598) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- Perfect simulation for a class of positive recurrent Markov chains (Q2456044) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- Simple permutations mix well (Q2581269) (← links)
- Sampling colourings of the triangular lattice (Q2904597) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- Randomly coloring random graphs (Q3055885) (← links)
- The Computational Complexity of Estimating MCMC Convergence Time (Q3088115) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)
- Simple permutations mix even better (Q3503604) (← links)
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609) (← links)
- Mixing 3-Colourings in Bipartite Graphs (Q3508565) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Fixed Precision MCMC Estimation by Median of Products of Averages (Q5321751) (← links)
- Finding a Level Ideal of a Poset (Q5323080) (← links)