Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)

Authors Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, Marcus Pappik and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.12.11.124.pdf
  • Filesize: 1.62 MB
  • 22 pages

Document Identifiers

Author Details

Holger Dell
  • Goethe-Universität - Frankfurt am Main, DE
Mark R. Jerrum
  • Queen Mary University of London, GB
Haiko Müller
  • University of Leeds, GB
Konrad Anand
  • Queen Mary University of London, G
Marcus Pappik
  • Hasso-Plattner-Institut, Universität Potsdam, DE
and all authors of the abstracts in this report

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail