Depth-3 arithmetic formulae over fields of characteristic zero

Amir Shpilka; Avi Wigderson

Depth-3 arithmetic formulae over fields of characteristic zero

Amir Shpilka^*, Avi Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

Abstract

In this paper we prove near quadratic lower bounds for depth-3 arithmetic formulae over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first non-trivial lower bounds for computing polynomials of constant degree, and a gap between the power depth-3 arithmetic formulas and depth-4 arithmetic formulas. The main technical contribution relates the complexity of computing a polynomial in this model to the wealth of partial derivatives it has on every affine subspace of small co-dimension. Lower bounds for related models utilize an algebraic analog of Nechiporuk lower bound on Boolean formulae.

Original language	English
Title of host publication	Proceedings of the Annual IEEE Conference on Computational Complexity
Publisher	IEEE Comp Soc
Pages	87-96
Number of pages	10
ISBN (Print)	0769500757
State	Published - 1999
Event	Proceedings of the 1999 14th Annual IEEE Conference on Computational Complexity - Atlanta, GA, USA Duration: 4 May 1999 → 6 May 1999

Publication series

Name	Proceedings of the Annual IEEE Conference on Computational Complexity
ISSN (Print)	1093-0159

Conference

Conference	Proceedings of the 1999 14th Annual IEEE Conference on Computational Complexity
City	Atlanta, GA, USA
Period	4/05/99 → 6/05/99

Cite this

@inproceedings{44b1c7a568174cbbacfcfb27f0741bbc,

title = "Depth-3 arithmetic formulae over fields of characteristic zero",

abstract = "In this paper we prove near quadratic lower bounds for depth-3 arithmetic formulae over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first non-trivial lower bounds for computing polynomials of constant degree, and a gap between the power depth-3 arithmetic formulas and depth-4 arithmetic formulas. The main technical contribution relates the complexity of computing a polynomial in this model to the wealth of partial derivatives it has on every affine subspace of small co-dimension. Lower bounds for related models utilize an algebraic analog of Nechiporuk lower bound on Boolean formulae.",

author = "Amir Shpilka and Avi Wigderson",

year = "1999",

language = "אנגלית",

isbn = "0769500757",

series = "Proceedings of the Annual IEEE Conference on Computational Complexity",

publisher = "IEEE Comp Soc",

pages = "87--96",

booktitle = "Proceedings of the Annual IEEE Conference on Computational Complexity",

note = "Proceedings of the 1999 14th Annual IEEE Conference on Computational Complexity ; Conference date: 04-05-1999 Through 06-05-1999",

}

Shpilka, A & Wigderson, A 1999, Depth-3 arithmetic formulae over fields of characteristic zero. in Proceedings of the Annual IEEE Conference on Computational Complexity. Proceedings of the Annual IEEE Conference on Computational Complexity, IEEE Comp Soc, pp. 87-96, Proceedings of the 1999 14th Annual IEEE Conference on Computational Complexity, Atlanta, GA, USA, 4/05/99.

Depth-3 arithmetic formulae over fields of characteristic zero. / Shpilka, Amir; Wigderson, Avi.
Proceedings of the Annual IEEE Conference on Computational Complexity. IEEE Comp Soc, 1999. p. 87-96 (Proceedings of the Annual IEEE Conference on Computational Complexity).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Depth-3 arithmetic formulae over fields of characteristic zero

AU - Shpilka, Amir

AU - Wigderson, Avi

PY - 1999

Y1 - 1999

N2 - In this paper we prove near quadratic lower bounds for depth-3 arithmetic formulae over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first non-trivial lower bounds for computing polynomials of constant degree, and a gap between the power depth-3 arithmetic formulas and depth-4 arithmetic formulas. The main technical contribution relates the complexity of computing a polynomial in this model to the wealth of partial derivatives it has on every affine subspace of small co-dimension. Lower bounds for related models utilize an algebraic analog of Nechiporuk lower bound on Boolean formulae.

AB - In this paper we prove near quadratic lower bounds for depth-3 arithmetic formulae over fields of characteristic zero. Such bounds are obtained for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant. As corollaries we get the first non-trivial lower bounds for computing polynomials of constant degree, and a gap between the power depth-3 arithmetic formulas and depth-4 arithmetic formulas. The main technical contribution relates the complexity of computing a polynomial in this model to the wealth of partial derivatives it has on every affine subspace of small co-dimension. Lower bounds for related models utilize an algebraic analog of Nechiporuk lower bound on Boolean formulae.

UR - http://www.scopus.com/inward/record.url?scp=0032644925&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0032644925

SN - 0769500757

T3 - Proceedings of the Annual IEEE Conference on Computational Complexity

SP - 87

EP - 96

BT - Proceedings of the Annual IEEE Conference on Computational Complexity

PB - IEEE Comp Soc

T2 - Proceedings of the 1999 14th Annual IEEE Conference on Computational Complexity

Y2 - 4 May 1999 through 6 May 1999

ER -

Depth-3 arithmetic formulae over fields of characteristic zero

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this