@InProceedings{forbes_et_al:LIPIcs.CCC.2016.33,
author = {Forbes, Michael A. and Kumar, Mrinal and Saptharishi, Ramprasad},
title = {{Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity}},
booktitle = {31st Conference on Computational Complexity (CCC 2016)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-008-8},
ISSN = {1868-8969},
year = {2016},
volume = {50},
editor = {Raz, Ran},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.33},
URN = {urn:nbn:de:0030-drops-58266},
doi = {10.4230/LIPIcs.CCC.2016.33},
annote = {Keywords: boolean circuits, arithmetic circuits, lower bounds, functional computation}
}