Computer Science – Computational Complexity
Scientific paper
2011-07-07
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Mumbai : India (20
Computer Science
Computational Complexity
16 pages
Scientific paper
10.4230/LIPIcs.FSTTCS.2011.127
Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has recently proposed a "real {\tau}-conjecture" which is inspired by this connection. The real {\tau}-conjecture states that the number of real roots of a sum of products of sparse univariate polynomials should be polynomially bounded. It implies a superpolynomial lower bound on the size of arithmetic circuits computing the permanent polynomial. In this paper we show that the real {\tau}-conjecture holds true for a restricted class of sums of products of sparse polynomials. This result yields lower bounds for a restricted class of depth-4 circuits: we show that polynomial size circuits from this class cannot compute the permanent, and we also give a deterministic polynomial identity testing algorithm for the same class of circuits.
Grenet Bruno
Koiran Pascal
Portier Natacha
Strozecki Yann
No associations
LandOfFree
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-417290