Interpolation of depth-3 arithmetic circuits with two multiplication gates

In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a finite field F, that have depth-3 arithmetic circuits (with an addition gate at the top) with two multiplication gates of degree at most d. We obtain the following results:

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Amir Shpilka
• Keywords: Algorithms, Depth-3 Arithmetic Circuits, Finite Field F, Small Arithmetic Circuit, STOC 2007