Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10481.2
URN: urn:nbn:de:0030-drops-29441
URL: https://drops.dagstuhl.de/opus/volltexte/2011/2944/
Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark
10481 Executive Summary -- Computational Counting
| pdf-format: |
|
Abstract
From November 28 to December 3 2010, the Dagstuhl seminar 10481``Computational Counting'' was held in Schloss Dagstuhl -- Leibnitz Center
for Informatics. 36 researchers from all over the world, with interests and
expertise in different aspects of computational counting, actively
participated in the meeting.
BibTeX - Entry
@InProceedings{burgisser_et_al:DagSemProc.10481.2,
author = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark},
title = {{10481 Executive Summary – Computational Counting}},
booktitle = {Computational Counting},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2011},
volume = {10481},
editor = {Peter B\"{u}rgisser and Leslie Ann Goldberg and Mark Jerrum},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2011/2944},
URN = {urn:nbn:de:0030-drops-29441},
doi = {10.4230/DagSemProc.10481.2},
annote = {Keywords: Computational complexity, counting problems, holographic algorithms, statistical physics, constraint satisfaction}
}
| Keywords: | Computational complexity, counting problems, holographic algorithms, statistical physics, constraint satisfaction | |
| Seminar: | 10481 - Computational Counting | |
| Issue date: | 2011 | |
| Date of publication: | 08.02.2011 |
