( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Relative Complexity of Approximate Counting Problems

, , , и . Algorithmica, 38 (3): 471--500 (декабря 2003)

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.

Matthias Dyer

Michael Dyer

Paul Dyer Merica

Martin Breitenfeldt

Mass measurements on short-lived Cd and Ag nuclides at the online mass spectrometer ISOLTRAP. Uni Greifswald, (2009)

Martin Faes

Analyse der mehrskaligen Transportmechanismen beim laminaren Mischen mittels laseroptischer und numerischer Methoden. Uni Hannover, (2009)
 

Другие публикации лиц с тем же именем

The Relative Complexity of Approximate Counting Problems, , , и . Algorithmica, 38 (3): 471--500 (марта 2004)The Relative Complexity of Approximate Counting Problems, , , и . Algorithmica, 38 (3): 471--500 (декабря 2003)Probabilistic Analysis of the Generalised Assignment Problem., и . IPCO, стр. 189-200. University of Waterloo Press, (1990)A dichotomy for bounded degree graph homomorphisms with nonnegative weights., , и . J. Comput. Syst. Sci., (2023)Path coupling without contraction., и . J. Discrete Algorithms, 5 (2): 280-292 (2007)Ordering Clone Libraries in Computational Biology., , и . J. Comput. Biol., 2 (2): 207-218 (1995)05201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms., , и . Design and Analysis of Randomized and Approximation Algorithms, том 05201 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)08201 Abstracts Collection - Design and Analysis of Randomized and Approximation Algorithms., , и . Design and Analysis of Randomized and Approximation Algorithms, том 08201 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)., , , и . Dagstuhl Reports, 1 (6): 24-53 (2011)Path coupling using stopping times and counting independent sets and colorings in hypergraphs., , и . Random Struct. Algorithms, 32 (3): 375-399 (2008)