- Mark
Richard Jerrum (born 1955) is a
British computer scientist and com****tional theorist.
Jerrum received his Ph.D. in
computer science 'On the complexity...
-
respect to both the size of the
problem and the
degree of
accuracy required.
Jerrum, Valiant, and
Vazirani showed that
every #P-complete
problem either has...
- doi:10.1007/BF00299636, hdl:10338.dmlcz/120489, S2CID 10838178 Sinclair, A.;
Jerrum, M. (1989), "Approximate counting,
uniform generation and
rapidly mixing...
- all the
subtrees regardless of size is #P-complete in the
general case (
Jerrum (1994)).
Counting the
number of
unlabeled free
trees is a
harder problem...
- to the
conductance of a graph. The
conductance was
first defined by Mark
Jerrum and
Alistair Sinclair in 1988 to
prove that the
permanent of a
matrix with...
- from the
University of
Edinburgh in 1988
under the
supervision of Mark
Jerrum. He is
professor at the
Computer Science division at the
University of California...
- that the
mixing time
grows only as n log ( n ) {\displaystyle n\log(n)} (
Jerrum 1995). This
example and the
shuffling example possess the
rapid mixing property...
- (2019).
Wrochna & Živný (2020). Jaeger,
Vertigan &
Welsh (1990).
Goldberg &
Jerrum (2008).
Holyer (1981).
Crescenzi & Kann (1998). Marx (2004).
Chaitin (1982)...
-
Pushdown Automata (1974)
Doctoral advisor Mike
Paterson Doctoral students Mark
Jerrum Michael Kearns Dan Roth
Website people.seas.harvard.edu/~valiant...
-
based on a
reduction in (Linial 1986).
Oxley &
Welsh (2002)
Goldberg &
Jerrum (2008) Biggs, N. (1993),
Algebraic Graph Theory,
Cambridge University Press...
