License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10481.1
URN: urn:nbn:de:0030-drops-29453
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/2945/
|
Go to the corresponding Portal |
Bürgisser, Peter ;
Goldberg, Leslie Ann ;
Jerrum, Mark
10481 Abstracts Collection -- Computational Counting
Abstract
From November 28 to December 3 2010, the Dagstuhl Seminar 10481 ``Computational Counting'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
BibTeX - Entry
@InProceedings{burgisser_et_al:DagSemProc.10481.1,
author = {B\"{u}rgisser, Peter and Goldberg, Leslie Ann and Jerrum, Mark},
title = {{10481 Abstracts Collection – Computational Counting}},
booktitle = {Computational Counting},
pages = {1--15},
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/2945},
URN = {urn:nbn:de:0030-drops-29453},
doi = {10.4230/DagSemProc.10481.1},
annote = {Keywords: Computational complexity, counting problems, holographic algorithms, statistical physics, constraint satisfaction}
}
|
Keywords: |
|
Computational complexity, counting problems, holographic algorithms, statistical physics, constraint satisfaction |
|
Collection: |
|
10481 - Computational Counting |
|
Issue Date: |
|
2011 |
|
Date of publication: |
|
08.02.2011 |
