@inproceedings{fijalkow_et_al:LIPIcs:2020:11885,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Arithmetic Circuit Complexity, Lower Bounds, Parse Trees, Hankel Matrix},
Author = {Fijalkow, Nathana{\"e}l and Lagarde, Guillaume and Ohlmann, Pierre and Serre, Olivier},
BookTitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
Editor = {Paul, Christophe and Bl{\"a}ser, Markus},
File = {Lower Bounds for Arithmetic Circuits via the Hankel Matrix - LIPIcs-STACS-2020-24 - a - a.pdf},
ISBN = {978-3-95977-140-5},
ISSN = {1868-8969},
Pages = {24:1--24:17},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Lower Bounds for Arithmetic Circuits via the Hankel Matrix}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11885},
Volume = {154},
Year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/11885},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2020.24},
date-added = {2020-10-16 16:58:26 +0200},
date-modified = {2020-10-16 16:58:26 +0200},
urn = {urn:nbn:de:0030-drops-118859},
doi = {10.4230/LIPIcs.STACS.2020.24}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A