Abstract:

An algebraic circuit computes a polynomial using addition and multiplication operators. Understanding the power of algebraic circuits has close connections to understanding general computation. It is known that proving lower bounds for algebraic circuits can serve as a stepping stone towards proving general Boolean circuit lower bounds.

Despite this, not many lower bounds are known for even simple Sigma Pi Sigma (product-depth 1) circuits. Before our work, the best known lower bound for product-depth 1 circuit was (slightly less than) cubic. No lower bounds were known for general product-depth 2 circuits.

In this work, we show the first superpolynomial lower bound for low-product-depth algebraic circuits.

In the talk, we discuss the main results and present the proof ideas used in the proof of the superpolynomial lower bound for product-depth 1 circuits.

This talk is based on joint work with Srikanth Srinivasan and Sébastien Tavenas.

Link:
[ Ссылка ]

свернуть