( en | de | ru )

 

Disambiguation of "Jerrum, Mark"

Author of the publication

copydeleteadd this publication to your clipboard
Inapproximability of the Tutte polynomial.

, and . STOC, page 459-468. ACM, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mark Yampolsky

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Mark Schütte

Crf2 - ein neues Antigen von Aspergillus fumigatus. TU Braunschweig, (2009)

Mark Yampolskiy

Maßnahmen zur Sicherung von E2E-QoS bei verketteten Diensten. Uni München, (2009)

Ana Markovi

Experimental and theoretical analysis of the mass transport through porous glass membranes with different pore diameters. Uni Magdeburg, (2009)

Mark Heuser

 

Other publications of authors with the same name

The Relative Complexity of Approximate Counting Problems, , , and . Algorithmica, 38 (3): 471--500 (December 2003)The Mixing Time of Glauber Dynamics for Colouring Regular Trees, , and . CoRR, (2008)The complexity of counting locally maximal satisfying assignments of Boolean CSPs., and . Theor. Comput. Sci., (2016)The complexity of weighted and unweighted #CSP., , , , , and . J. Comput. Syst. Sci., 78 (2): 681-688 (2012)Approximating the Partition Function of the Ferromagnetic Potts Model., and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 396-407. Springer, (2010)Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 1-13. Springer, (1995)A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols., , , and . ICALP, volume 1853 of Lecture Notes in Computer Science, page 705-716. Springer, (2000)The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 399-410. Springer, (2012)A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability., and . SIAM J. Comput., 48 (3): 964-978 (2019)On Approximately Counting Colorings of Small Degree Graphs., , , and . SIAM J. Comput., 29 (2): 387-400 (1999)