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.12.9.41
URN: urn:nbn:de:0030-drops-178092
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/17809/
Bläser, Markus ;
Kabanets, Valentine ;
Shaltiel, Ronen ;
Torán, Jacobo
Weitere Beteiligte (Hrsg. etc.): Markus Bläser and Valentine Kabanets and Ronen Shaltiel and Jacobo Torán
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 2237 "Algebraic and Analytic Methods in Computational Complexity".
Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting.
Beside algebraic methods, analytic methods have been used for quite some time in theoretical computer science. These methods can also be used to solve algebraic problems as show by many recent examples in the areas of derandomization, coding theory or circuit lower bounds. These new directions were in the focus of the Dagstuhl Seminar and reflect the developments in the field since the previous Dagstuhl Seminar 18391.
This Dagstuhl Seminar brought together researchers who are using a diverse array of algebraic and analytic methods in a variety of settings. Researchers in these areas are relying on ever more sophisticated and specialized mathematics and this seminar played a role in educating a diverse community about the latest new techniques, spurring further progress.
BibTeX - Entry
@Article{blaser_et_al:DagRep.12.9.41,
author = {Bl\"{a}ser, Markus and Kabanets, Valentine and Shaltiel, Ronen and Tor\'{a}n, Jacobo},
title = {{Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)}},
pages = {41--59},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2023},
volume = {12},
number = {9},
editor = {Bl\"{a}ser, Markus and Kabanets, Valentine and Shaltiel, Ronen and Tor\'{a}n, Jacobo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/17809},
URN = {urn:nbn:de:0030-drops-178092},
doi = {10.4230/DagRep.12.9.41},
annote = {Keywords: (de-)randomization, algebra, circuits, coding, computational complexity}
}
|
Keywords: |
|
(de-)randomization, algebra, circuits, coding, computational complexity |
|
Collection: |
|
DagRep, Volume 12, Issue 9 |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
04.04.2023 |
