The following pages link to Mark R. Jerrum (Q1058289):
Displaying 50 items.
- (Q269467) (redirect page) (← links)
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
- A counterexample to rapid mixing of the Ge-Stefankovic process (Q428729) (← links)
- A complexity dichotomy for hypergraph partition functions (Q626694) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- On the approximation of one Markov chain by another (Q818819) (← links)
- Two remarks concerning balanced matroids (Q879171) (← links)
- Fast uniform generation of regular graphs (Q909471) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- Markov chain comparison (Q980750) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- The complexity of finding minimum-length generator sequences (Q1058290) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← links)
- Simple translation-invariant concepts are hard to learn (Q1333264) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- The Metropolis algorithm for graph bisection (Q1383365) (← links)
- Random cluster dynamics for the Ising model is rapidly mixing (Q1650104) (← links)
- The parameterised complexity of counting even and odd induced subgraphs (Q1714949) (← links)
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains (Q1769410) (← links)
- An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) (← links)
- The relative complexity of approximate counting problems (Q1879247) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- A mildly exponential approximation algorithm for the permanent (Q1923855) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials (Q1936248) (← links)
- The Swendsen-Wang process does not always mix rapidly (Q1969279) (← links)
- Perfect simulation of the hard disks model by partial rejection sampling (Q2031485) (← links)
- The size of the giant joint component in a binomial random double graph (Q2227829) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings (Q2719118) (← links)
- (Q2753731) (← links)
- (Q2754189) (← links)
- Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard (Q2810271) (← links)
- Some Hard Families of Parameterized Counting Problems (Q2832302) (← links)
- The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (Q2843265) (← links)
- (Q2904771) (← links)
- The complexity of parity graph homomorphism: an initial investigation (Q2941645) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
- The complexity of approximating conservative counting CSPs. (Q2957879) (← links)
