@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2023.9,
author = {Chattopadhyay, Eshan and Liao, Jyun-Jie},
title = {{Hardness Against Linear Branching Programs and More}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {9:1--9:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.9},
URN = {urn:nbn:de:0030-drops-182794},
doi = {10.4230/LIPIcs.CCC.2023.9},
annote = {Keywords: linear branching programs, circuit lower bound, sumset extractors, hitting sets}
}