@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/entities/document/10.4230/DagRep.13.3.17},
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}
}