Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagRep.12.11.124
URN: urn:nbn:de:0030-drops-178394
URL: https://drops.dagstuhl.de/opus/volltexte/2023/17839/
Dell, Holger ; Jerrum, Mark R. ; Müller, Haiko ; Anand, Konrad ; Pappik, Marcus
Weitere Beteiligte (Hrsg. etc.): Holger Dell and Mark R. Jerrum and Haiko Müller and Konrad Anand and Marcus Pappik
Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@Article{dell_et_al:DagRep.12.11.124,
author = {Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus},
title = {{Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)}},
pages = {124--145},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {12},
number = {11},
editor = {Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17839},
URN = {urn:nbn:de:0030-drops-178394},
doi = {10.4230/DagRep.12.11.124},
annote = {Keywords: Sampling, Counting, Algorithms, Complexity, Statistical Physics, Phase Transitions, Markov Chains, Graphs, Point Processes}
}
| Keywords: | Sampling, Counting, Algorithms, Complexity, Statistical Physics, Phase Transitions, Markov Chains, Graphs, Point Processes | |
| Seminar: | DagRep, Volume 12, Issue 11 | |
| Issue date: | 2023 | |
| Date of publication: | 04.05.2023 |
