• Medientyp: E-Artikel; Sonstige Veröffentlichung
  • Titel: Computational Complexity of Discrete Problems (Dagstuhl Seminar 21121)
  • Beteiligte: Gál, Anna [VerfasserIn]; Mahajan, Meena [VerfasserIn]; Santhanam, Rahul [VerfasserIn]; Tantau, Till [VerfasserIn]
  • Erschienen: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
  • Sprache: Englisch
  • DOI: https://doi.org/10.4230/DagRep.11.2.1
  • Schlagwörter: communication complexity ; circuit complexity ; computational complexity ; lower bounds ; randomness
  • Entstehung:
  • Anmerkungen: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Beschreibung: 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.
  • Zugangsstatus: Freier Zugang