Counting and Sampling: Algorithms and Complexity

Dell, H., Jerrum, M.R., Müller, H. orcid.org/0000-0002-1123-1774 et al. (2 more authors) (2023) Counting and Sampling: Algorithms and Complexity. Dagstuhl Reports, 12 (11). pp. 124-145. ISSN 2192-5283

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2023 Schloss Dagstuhl - LZI GmbH. This is an open access article under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Keywords: Sampling, Counting, Algorithms, Complexity, Statistical Physics, Phase Transitions, Markov Chains, Graphs, Point Processes
Dates:
  • Published: 4 May 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/S016562/1
Depositing User: Symplectic Publications
Date Deposited: 31 Jan 2024 12:43
Last Modified: 31 Jan 2024 12:43
Status: Published
Publisher: Schloss Dagstuhl
Identification Number: https://doi.org/10.4230/DagRep.12.11.124

Export

Statistics


CORE (COnnecting REpositories)