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.7.8.23
URN: urn:nbn:de:0030-drops-84283
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8428/
Go back to Dagstuhl Reports

Bezáková, Ivona ; Goldberg, Leslie Ann ; Jerrum, Mark R.
Weitere Beteiligte (Hrsg. etc.): Ivona Bezáková and Leslie Ann Goldberg and Mark R. Jerrum

Computational Counting (Dagstuhl Seminar 17341)

pdf-format:
dagrep_v007_i008_p023_17341.pdf (3 MB)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 17341 "Computational Counting". The seminar was held from 20th to 25th August 2017, 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{bezkov_et_al:DR:2018:8428,
  author =	{Ivona Bez{\'a}kov{\'a} and Leslie Ann Goldberg and Mark R. Jerrum},
  title =	{{Computational Counting (Dagstuhl Seminar 17341)}},
  pages =	{23--44},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{7},
  number =	{8},
  editor =	{Ivona Bez{\'a}kov{\'a} and Leslie Ann Goldberg and Mark R. Jerrum},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2018/8428},
  URN =		{urn:nbn:de:0030-drops-84283},
  doi =		{10.4230/DagRep.7.8.23},
  annote =	{Keywords: approximation algorithms, computational complexity, counting problems, partition functions, phase transitions}
}

Keywords: approximation algorithms, computational complexity, counting problems, partition functions, phase transitions
Collection: Dagstuhl Reports, Volume 7, Issue 8
Issue Date: 2018
Date of publication: 06.02.2018

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