@InProceedings{garg_et_al:LIPIcs.CCC.2019.22,
author = {Garg, Sumegha and Raz, Ran and Tal, Avishay},
title = {{Time-Space Lower Bounds for Two-Pass Learning}},
booktitle = {34th Computational Complexity Conference (CCC 2019)},
pages = {22:1--22:39},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-116-0},
ISSN = {1868-8969},
year = {2019},
volume = {137},
editor = {Shpilka, Amir},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.22},
URN = {urn:nbn:de:0030-drops-108446},
doi = {10.4230/LIPIcs.CCC.2019.22},
annote = {Keywords: branching program, time-space tradeoffs, two-pass streaming, PAC learning, lower bounds}
}