@article{Fijalkow:2021va,
Abstract = {We study the complexity of representing polynomials by arithmeticcircuits in both the commutative and the non-commutative settings.Our approach goes through a precise understanding of the morerestricted setting where multiplication is not associative, meaningthat we distinguish (xy)z from x(yz).},
Author = {Fijalkow, Nathana{\"e}l and Lagarde, Guillaume and Ohlmann, Pierre and Serre, Olivier},
Date = {2021/10/08},
File = {Lower Bounds for Arithmetic Circuits via the Hankel Matrix - Fijalkow2021\_Article\_LowerBoundsForArithmeticCircui.pdf},
ISBN = {1420-8954},
Journal = {computational complexity},
Number = {2},
Pages = {14},
Title = {Lower Bounds for Arithmetic Circuits via the Hankel Matrix},
URL = {https://doi.org/10.1007/s00037-021-00214-1},
Volume = {30},
Year = {2021},
bdsk-url-1 = {https://doi.org/10.1007/s00037-021-00214-1},
date-added = {2021-11-17 17:26:49 +0100},
date-modified = {2021-11-17 17:26:50 +0100},
id = {Fijalkow2021},
doi = {10.1007/s00037-021-00214-1}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A