@InProceedings{saptharishi_et_al:LIPIcs.FSTTCS.2018.6,
author = {Saptharishi, Ramprasad and Tengse, Anamay},
title = {{Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.6},
URN = {urn:nbn:de:0030-drops-99050},
doi = {10.4230/LIPIcs.FSTTCS.2018.6},
annote = {Keywords: Unambiguous Circuits, Read-once Oblivious ABPs, Polynomial Identity Testing, Lower Bounds, Algebraic Circuit Complexity}
}