License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2019.1
URN: urn:nbn:de:0030-drops-102405
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10240/
Go to the corresponding LIPIcs Volume Portal


Goldberg, Leslie Ann

Computational Complexity and Partition Functions (Invited Talk)

pdf-format:
LIPIcs-STACS-2019-1.pdf (0.3 MB)


Abstract

This paper is an extended abstract of my STACS 2019 talk "Computational Complexity and Partition Functions".

BibTeX - Entry

@InProceedings{goldberg:LIPIcs:2019:10240,
  author =	{Leslie Ann Goldberg},
  title =	{{Computational Complexity and Partition Functions (Invited Talk)}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{1:1--1:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Rolf Niedermeier and Christophe Paul},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10240},
  doi =		{10.4230/LIPIcs.STACS.2019.1},
  annote =	{Keywords: partition functions, approximation}
}

Keywords: partition functions, approximation
Collection: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Issue Date: 2019
Date of publication: 12.03.2019


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