Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,400,059 papers from all fields of science
Search
Sign In
Create Free Account
Mark Jerrum
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist. Jerrum received his Ph.D. in computer science in 1981…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Alistair Sinclair
British Colloquium for Theoretical Computer Science
Computing the permanent
Fulkerson Prize
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Glauber Dynamics for Sampling an Edge Colouring of Regular
T. Poon
,
Chun Yeung
2016
Corpus ID: 10551705
We study the problem of sampling a graph colouring using Glauber Dynamics. This is an interesting problem as Jerrum showed that…
Expand
2012
2012
Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems
A. Bompadre
Algorithmica
2012
Corpus ID: 15041882
We prove exponential lower bounds on the running time of Dynamic Programs (DP) of a certain class for some Combinatorial…
Expand
2011
2011
Vigoda's Improvement On Sampling Colorings
Shahrzad Haddadan
2011
Corpus ID: 12091793
- In 1995, Jerrum proved a rapid mixing property on a certain Markov chain to solve the problem of sampling uniformly at random…
Expand
2009
2009
About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness
Y. Gérard
International Workshop on Computational…
2009
Corpus ID: 27448668
We consider the problem of 3-dimensional Discrete Tomography according to three linearly independent directions. Consistency of…
Expand
2008
2008
MAS309 Coding theory
M. Fayers
,
Nilmini Herath
,
Julian D. A. Wiseman
,
Dilara Azizova
2008
Corpus ID: 5424631
This is a set of notes which is supposed to augment your own notes for the Coding Theory course. They were written by Matthew…
Expand
2003
2003
Estimating the permanent
Eric Vigoda
2003
Corpus ID: 670934
We refer the reader to Jerrum's book [1] for the analysis of a Markov chain for generating a random matching of an arbitrary…
Expand
2000
2000
On approximate graph colouring and MAX-k-CUT algorithms based on the θ-function
Ôóðýòóñññð Øøññ
,
Ý Ù××òò
,
Ø Ñó×ø Ññò Ò Ç Ò ½ ¿´·½µ Ç ¡ ½ ¾ Ó Óðóùö׸ûûûöö Ò Î
2000
Corpus ID: 268082655
1998
1998
Special Issue of DAM on the Vapnik-chervonenkis Dimension
J. Shawe-Taylor
Discrete Applied Mathematics
1998
Corpus ID: 206027012
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE