The beta version of DROPS 2 is now publicly available! Check this page out at DROPS 2 now!


License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.11.2.1
URN: urn:nbn:de:0030-drops-146836
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14683/
Go back to Dagstuhl Reports

Gál, Anna ; Mahajan, Meena ; Santhanam, Rahul ; Tantau, Till
Weitere Beteiligte (Hrsg. etc.): Anna Gál and Meena Mahajan and Rahul Santhanam and Till Tantau

Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)

pdf-format:
dagrep_v011_i002_p001_21121.pdf (1 MB)

Abstract

This report documents the program and activities of Dagstuhl Seminar 21121 "Computational Complexity of Discrete Problems," which was held online in March 2021. Starting with a description of the organization of the online meeting and the topics covered, we then list the different talks given during the seminar in alphabetical order of speakers, followed by the abstracts of the talks, including the main references and relevant sources where applicable. Despite the fact that only a compressed daily time slot was available for the seminar with participants from time zones spanning the whole globe and despite the fact that informal discussions were harder to hold than in a typical on-site seminar, the rate of participation throughout the seminar was very high and many lively scientific debates were held.

BibTeX - Entry

@Article{gal_et_al:DagRep.11.2.1,
  author =	{G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till},
  title =	{{Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)}},
  pages =	{1--16},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2021},
  volume =	{11},
  number =	{2},
  editor =	{G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14683},
  URN =		{urn:nbn:de:0030-drops-146836},
  doi =		{10.4230/DagRep.11.2.1},
  annote =	{Keywords: circuit complexity, communication complexity, computational complexity, lower bounds, randomness}
}

Keywords: circuit complexity, communication complexity, computational complexity, lower bounds, randomness
Collection: DagRep, Volume 11, Issue 2
Issue Date: 2021
Date of publication: 07.09.2021

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