Proceedings of IEEE 36th Annual Foundations of Computer Science (1995)
Oct. 23, 1995 to Oct. 25, 1995
N. Nisan , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
A. Wigderson , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
We describe a new technique for obtaining lower bounds on restricted classes of non-monotone arithmetic circuits. The heart of this technique is a complexity measure for multivariate polynomials, based on the linear span of their partial derivatives. We use the technique to obtain new lower bounds for computing symmetric polynomials and iterated matrix products.
computational complexity; polynomials; logic circuits; digital arithmetic; minimisation of switching nets; arithmetic circuits; partial derivatives; lower bounds; restricted classes; complexity measure; multivariate polynomials
N. Nisan and A. Wigderson, "Lower bounds on arithmetic circuits via partial derivatives," Proceedings of IEEE 36th Annual Foundations of Computer Science(FOCS), Milwaukee, Wisconsin, 1995, pp. 16.