AI helps you reading Science
An exponential lower bound for depth 3 arithmetic circuits
An Exponential Lower Bound for Depth 3 Arithmetic Circuits, pp.577-582, (1999)
EI
Abstract
We prove the first exponential lower bound onthe size of any depth 3 arithmetic circuit withunbounded fanin computing an explicit function(the determinant) over an arbitrary finitefield. This answers an open problem of [N91]and [NW95] for the case of finite fields. Weintepret here arithmetic circuits in the algebraof polynomials over the...More
Code:
Data:
Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn