The shifted partial derivative complexity of elementary symmetric polynomials

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We continue the study of the shifted partial derivative measure, introduced by Kayal (ECCC 2012), which has been used to prove many strong depth-4 circuit lower bounds starting from the work of Kayal, and that of Gupta et al. (CCC 2013). We show a strong lower bound on the dimension of the shifted partial derivative space of the Elementary Symmetric Polynomials of degree d in N variables for d

Cite

CITATION STYLE

APA

Fournier, H., Limaye, N., Mahajan, M., & Srinivasan, S. (2015). The shifted partial derivative complexity of elementary symmetric polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9235, pp. 324–335). Springer Verlag. https://doi.org/10.1007/978-3-662-48054-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free