Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Mark
    Last name: Jerrum
    DBLP: j/MarkJerrum
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 154  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Heng Guo 0001, Mark Jerrum.
    Random cluster dynamics for the Ising model is rapidly mixing.
    Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19 2017 (0) 2017
    Book chapter
    Mark Jerrum.
    Counting Constraint Satisfaction Problems.
    The Constraint Satisfaction Problem: Complexity and Approximability 2017, Volume 7 (0) 2017
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    A Complexity Trichotomy for Approximately Counting List
    TOCT 2016, Volume 9 (0) 2017
    Conference paper
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the Switch Markov Chain for Perfect Matchings.
    J. ACM 2017, Volume 64 (0) 2017
    Journal article
    Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny.
    Functional clones and expressibility of partition functions.
    Theor. Comput. Sci. 2017, Volume 687 (0) 2017
    Conference paper
    Heng Guo 0001, Mark Jerrum, Jingcheng Liu 0001.
    Uniform sampling through the Lovasz local lemma.
    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017 2017 (0) 2017
    Conference paper
    Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda.
    Random Walks on Small World Networks.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the switch Markov chain for perfect matchings.
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    A complexity trichotomy for approximately counting list H-colourings.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    The complexity of counting locally maximal satisfying assignments of Boolean CSPs.
    Theor. Comput. Sci. 2016, Volume 634 (0) 2016
    Conference paper
    Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Mark Jerrum, Daniel Stefankovic, Eric Vigoda.
    #BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.
    J. Comput. Syst. Sci. 2016, Volume 82 (0) 2016
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard.
    SIAM J. Comput. 2016, Volume 45 (0) 2016
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    A Complexity Trichotomy for Approximately Counting List H-Colourings.
    43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy 2016 (0) 2016
    Conference paper
    Andrei A. Bulatov, Leslie Ann Goldberg, Mark Jerrum, David Richerby, Stanislav Zivny.
    Functional Clones and Expressibility of Partition Functions.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Heng Guo 0001, Mark Jerrum, Jingcheng Liu 0001.
    Uniform Sampling through the Lovász Local Lemma.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Heng Guo 0001, Mark Jerrum.
    Random cluster dynamics for the Ising model is rapidly mixing.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan.
    Approximating the partition function of planar two-state spin systems.
    J. Comput. Syst. Sci. 2015, Volume 81 (0) 2015
    Journal article
    Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby.
    The complexity of approximating conservative counting CSPs.
    J. Comput. Syst. Sci. 2015, Volume 81 (0) 2015
    Journal article
    Martin E. Dyer, Mark Jerrum, Haiko Müller.
    On the switch Markov chain for perfect matchings.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Mark Jerrum, Kitty Meeks.
    The parameterised complexity of counting connected subgraphs and graph motifs.
    J. Comput. Syst. Sci. 2015, Volume 81 (0) 2015
    Journal article
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    Approximately Counting H-Colourings is #BIS-Hard.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    John Faben, Mark Jerrum.
    The Complexity of Parity Graph Homomorphism: An Initial Investigation.
    Theory of Computing 2015, Volume 11 (0) 2015
    Conference paper
    Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum.
    Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Mark Jerrum, Kitty Meeks.
    Some Hard Families of Parameterized Counting Problems.
    TOCT 2014, Volume 7 (0) 2015
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    The complexity of Boolean #MaximalCSP.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Approximately Counting Tree Homomorphisms.
    TOCT 2014, Volume 6 (0) 2014
    Conference paper
    Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda.
    #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Mark Jerrum, Kitty Meeks.
    The parameterised complexity of counting even and odd induced subgraphs.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Computing the Sign of the Tutte Polynomial.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials.
    J. Comput. Syst. Sci. 2013, Volume 79 (0) 2013
    Conference paper
    Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby.
    The complexity of approximating conservative counting CSPs.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Approximately Counting Tree Homomorphisms
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, Pascal Koiran.
    Computational Counting (Dagstuhl Seminar 13031).
    Dagstuhl Reports 2013, Volume 3 (0) 2013
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid.
    SIAM J. Comput. 2013, Volume 42 (0) 2013
    Conference paper
    Mark Jerrum, Kitty Meeks.
    The Parameterised Complexity of Counting Connected Subgraphs.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    John Faben, Mark Jerrum.
    The complexity of parity graph homomorphism: an initial investigation.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan.
    The expressibility of functions on the boolean domain, with applications to counting CSPs.
    J. ACM 2013, Volume 60 (0) 2013
    Journal article
    Mark Jerrum, Kitty Meeks.
    Some hard classes of parameterised counting problems.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Jin-Yi Cai, Leslie Ann Goldberg, Heng Guo, Mark Jerrum.
    Approximating the Partition Function of Two-Spin Systems on Bipartite Graphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby.
    The complexity of weighted and unweighted #CSP.
    J. Comput. Syst. Sci. 2012, Volume 78 (0) 2012
    Conference paper
    Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Log-supermodular functions, functional clones and counting CSPs.
    29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France 2012 (0) 2012
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation).
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan.
    Approximating the partition function of planar two-state spin systems
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby.
    The complexity of approximating conservative counting CSPs
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Inapproximability of the Tutte polynomial of a planar graph.
    Computational Complexity 2012, Volume 21 (0) 2012
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Approximating the partition function of the ferromagnetic potts model.
    J. ACM 2012, Volume 59 (0) 2012
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid.
    Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 (0) 2011
    Journal article
    Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Log-supermodular functions, functional clones and counting CSPs
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    A Counterexample to rapid mixing of the Ge-Stefankovic Process
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Andrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby.
    The complexity of weighted and unweighted #CSP
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Approximating the Partition Function of the Ferromagnetic Potts Model.
    Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I 2010 (0) 2010
    Conference paper
    Mark Jerrum.
    Constraint satisfaction problems and computational complexity: technical persepctive.
    Commun. CACM 2010, Volume 53 (0) 2010
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski.
    The mixing time of Glauber dynamics for coloring regular trees.
    Random Struct. Algorithms 2010, Volume 36 (0) 2010
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    A Complexity Dichotomy For Hypergraph Partition Functions.
    Computational Complexity 2010, Volume 19 (0) 2010
    Conference paper
    Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley.
    A Complexity Dichotomy for Partition Functions with Mixed Signs.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Conference paper
    Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum.
    10481 Abstracts Collection - Computational Counting.
    Computational Counting, 28.11. - 03.12.2010 2010 (0) 2010
    Conference paper
    Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum.
    10481 Executive Summary - Computational Counting.
    Computational Counting, 28.11. - 03.12.2010 2010 (0) 2010
    Journal article
    Leslie Ann Goldberg, Mark Jerrum.
    Approximating the partition function of the ferromagnetic Potts model
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    An approximation trichotomy for Boolean #CSP.
    J. Comput. Syst. Sci. 2010, Volume 76 (0) 2010
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Inapproximability of the Tutte polynomial of a planar graph
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Weighted Boolean CSP.
    SIAM J. Comput. 2008, Volume 38 (0) 2009
    Conference paper
    Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley.
    A Complexity Dichotomy for Partition Functions with Mixed Signs.
    26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009 (0) 2009
    Conference paper
    Martin E. Dyer, Mark Jerrum, Marek Karpinski.
    08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms.
    Design and Analysis of Randomized and Approximation Algorithms, 11.05. - 16.05.2008 2008 (0) 2008
    Conference paper
    Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley.
    A complexity dichotomy for partition functions with mixed signs
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski.
    The Mixing Time of Glauber Dynamics for Colouring Regular Trees
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    A complexity dichotomy for hypergraph partition functions
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Dobrushin Conditions and Systematic Scan.
    Combinatorics, Probability Computing 2008, Volume 17 (0) 2008
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Inapproximability of the Tutte polynomial.
    Inf. Comput. 2008, Volume 206 (0) 2008
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Inapproximability of the Tutte polynomial.
    Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 2007 (0) 2007
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Matrix norms and rapid mixing for spin systems
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Weighted Boolean #CSP
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    An approximation trichotomy for Boolean #CSP
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    The Complexity of Ferromagnetic Ising with Local Fields.
    Combinatorics, Probability Computing 2007, Volume 16 (0) 2007
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Dobrushin Conditions and Systematic Scan.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Compu 2006 (0) 2006
    Conference paper
    Mark Jerrum.
    Two Remarks Concerning Balanced Matroids.
    Combinatorica 2006, Volume 26 (0) 2006
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    Inapproximability of the Tutte polynomial
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell Martin.
    Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.
    SIAM J. Comput. 2006, Volume 36 (0) 2006
    Conference paper
    Martin E. Dyer, Mark Jerrum, Marek Karpinski.
    05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms.
    Design and Analysis of Randomized and Approximation Algorithms, 15.05. - 20.05.2005 2005 (0) 2005
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Dobrushin conditions and Systematic Scan
    Electronic Colloquium on Computational Complexity (ECCC) 2005, Volume null (0) 2005
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Counting and sampling H-colourings?
    Inf. Comput. 2004, Volume 189 (0) 2004
    Conference paper
    Mark Jerrum, Alistair Sinclair, Eric Vigoda.
    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
    J. ACM 2004, Volume 51 (0) 2004
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson.
    A bound on the capacity of backoff and acknowledgment-based protocols.
    SIAM J. Comput. 2004, Volume 33 (0) 2004
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum.
    The Relative Complexity of Approximate Counting Problems.
    Algorithmica 2003, Volume 38 (0) 2003
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum, Mike Paterson.
    The computational complexity of two-state spin systems.
    Random Struct. Algorithms 2003, Volume 23 (0) 2003
    Conference paper
    Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell Martin.
    Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.
    43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings 2002 (0) 2002
    Conference paper
    Mark Jerrum, Jung-Bae Son.
    Spectral Gap and log-Sobolev Constant for Balanced Matroids.
    43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings 2002 (0) 2002
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum.
    Counting and Sampling H-Colourings.
    Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Martin E. Dyer, Mark Jerrum, Eric Vigoda.
    Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.
    Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum.
    Convergence Of The Iterated Prisoner's Dilemma Game
    Combinatorics, Probability Computing 2002, Volume 11 (0) 2002
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum.
    The "Burnside Process" Converges Slowly
    Combinatorics, Probability Computing 2002, Volume 11 (0) 2002
    Conference paper
    Martin E. Dyer, Alan M. Frieze, Mark Jerrum.
    On Counting Independent Sets in Sparse Graphs.
    SIAM J. Comput. 2001, Volume 31 (0) 2002
    Conference paper
    Martin E. Dyer, Mark Jerrum, Eric Vigoda.
    Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.
    Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001 2004 (0) 2001
    Conference paper
    Mark Jerrum, Alistair Sinclair, Eric Vigoda.
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries.
    STOC 2001 (0) 2001
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum.
    On the relative complexity of approximate counting problems.
    Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson.
    A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols.
    Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum, Michael Mitzenmacher.
    An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract).
    SODA 2000 (0) 2000
    Conference paper
    Mark Jerrum, Eric Vigoda.
    A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
    Electronic Colloquium on Computational Complexity (ECCC) 2000, Volume 7 (0) 2000
    Show item 1 to 100 of 154  

    Your query returned 154 matches in the database.