@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2020.25,
author = {Chattopadhyay, Eshan and Liao, Jyun-Jie},
title = {{Optimal Error Pseudodistributions for Read-Once Branching Programs}},
booktitle = {35th Computational Complexity Conference (CCC 2020)},
pages = {25:1--25:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-156-6},
ISSN = {1868-8969},
year = {2020},
volume = {169},
editor = {Saraf, Shubhangi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.25},
URN = {urn:nbn:de:0030-drops-125779},
doi = {10.4230/LIPIcs.CCC.2020.25},
annote = {Keywords: Derandomization, explicit constructions, space-bounded computation}
}