License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.3.1.47
URN: urn:nbn:de:0030-drops-40087
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4008/
Go back to Dagstuhl Reports

Bürgisser, Peter ; Goldberg, Leslie Ann ; Jerrum, Mark ; Koiran, Pascal
Weitere Beteiligte (Hrsg. etc.): Peter Bürgisser and Leslie Ann Goldberg and Mark Jerrum and Pascal Koiran

Computational Counting (Dagstuhl Seminar 13031)

pdf-format:
dagrep_v003_i001_p047_s13031.pdf (0.7 MB)

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.

BibTeX - Entry

@Article{brgisser_et_al:DR:2013:4008,
  author =	{Peter B{\"u}rgisser and Leslie Ann Goldberg and Mark Jerrum and Pascal Koiran},
  title =	{{Computational Counting (Dagstuhl Seminar 13031)}},
  pages =	{47--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{1},
  editor =	{Peter B{\"u}rgisser and Leslie Ann Goldberg and Mark Jerrum and Pascal Koiran},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4008},
  URN =		{urn:nbn:de:0030-drops-40087},
  doi =		{10.4230/DagRep.3.1.47},
  annote =	{Keywords: Computational complexity, counting problems, graph polynomials, holographic algorithms,  statistical physics, constraint satisfaction}
}

Keywords: Computational complexity, counting problems, graph polynomials, holographic algorithms, statistical physics, constraint satisfaction
Collection: Dagstuhl Reports, Volume 3, Issue 1
Issue Date: 2013
Date of publication: 03.06.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI