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.13.3.17
URN: urn:nbn:de:0030-drops-192261
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19226/
Go back to Dagstuhl Reports

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

Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)

pdf-format:
dagrep_v013_i003_p017_23111.pdf (2 MB)

Abstract

This report documents the program and activities of Dagstuhl Seminar 23111 "Computational Complexity of Discrete Problems", which was held in-person in March 2023 (the previous instance of the seminar series had been held online in March 2021). Following a description of the seminar’s objectives and its overall organization, this report lists the different major 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. The return to an in-person setting allowed an intense atmosphere of active research and interaction throughout the five day seminar.

BibTeX - Entry

@Article{gal_et_al:DagRep.13.3.17,
  author =	{G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till and Paraashar, Manaswi},
  title =	{{Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)}},
  pages =	{17--31},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{3},
  editor =	{G\'{a}l, Anna and Mahajan, Meena and Santhanam, Rahul and Tantau, Till and Paraashar, Manaswi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/19226},
  URN =		{urn:nbn:de:0030-drops-192261},
  doi =		{10.4230/DagRep.13.3.17},
  annote =	{Keywords: circuit complexity, communication complexity, computational complexity, lower bounds, randomness}
}

Keywords: circuit complexity, communication complexity, computational complexity, lower bounds, randomness
Collection: DagRep, Volume 13, Issue 3
Issue Date: 2023
Date of publication: 16.10.2023

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