2026-07-23T18:19:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17839 2026-04-20T13:16:04Z ddc:004 open_access

Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482) Dell, Holger Jerrum, Mark R. Müller, Haiko Anand, Konrad Pappik, Marcus Sampling Counting Algorithms Complexity Statistical Physics Phase Transitions Markov Chains Graphs Point Processes This report documents the program and the outcomes of Dagstuhl Seminar 22482 "Counting and Sampling: Algorithms and Complexity". We document the talks presented, covering many advances in the area made over the last five years. As well, we document the progress made by working groups on future projects. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Holger Dell and Mark R. Jerrum and Haiko Müller and Konrad Anand and Marcus Pappik 2023 Is Part Of Dagstuhl Reports, Volume 12, Issue 11 (2023) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.12.11.124 urn:nbn:de:0030-drops-178394 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.124 eng https://creativecommons.org/licenses/by/4.0/legalcode