DagRep.12.11.124.pdf
- Filesize: 1.62 MB
- 22 pages
Document
Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 12, Issue 11
Volume: Dagstuhl Reports, Volume 12
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-05-04
Cite AsGet BibTex
Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, and Marcus Pappik. Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). In Dagstuhl Reports, Volume 12, Issue 11, pp. 124-145, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/DagRep.12.11.124
https://doi.org/10.4230/DagRep.12.11.124
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational complexity and cryptography
- Theory of computation → Design and analysis of algorithms
- Theory of computation → Randomness, geometry and discrete structures
- Mathematics of computing → Discrete mathematics
- Mathematics of computing → Probability and statistics
- Mathematics of computing → Mathematical analysis
Keywords
- Sampling
- Counting
- Algorithms
- Complexity
- Statistical Physics
- Phase Transitions
- Markov Chains
- Graphs
- Point Processes
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads