DagRep.3.1.47.pdf
- Filesize: 0.74 MB
- 20 pages
Document
Computational Counting (Dagstuhl Seminar 13031)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 3, Issue 1
Volume: Dagstuhl Reports, Volume 3
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2013-06-03
Cite As Get BibTex
Peter Bürgisser, Leslie Ann Goldberg, Mark Jerrum, and Pascal Koiran. Computational Counting (Dagstuhl Seminar 13031). In Dagstuhl Reports, Volume 3, Issue 1, pp. 47-66, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.3.1.47
Abstract
Dagstuhl Seminar 13031 "Computational Counting" was held from 13th to 18th January 2013, at Schloss Dagstuhl -- Leibnitz Center for Informatics. A total of 43 researchers from all over the world, with interests and expertise in different aspects of computational counting, actively participated in the meeting.
Subject Classification
Keywords
- Computational complexity
- counting problems
- graph polynomials
- holographic algorithms
- statistical physics
- constraint satisfaction
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads