Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
On the complexities of multipoint evaluation and interpolation
Theoretical Computer Science
Note: On decompositions of complete hypergraphs
Journal of Combinatorial Theory Series A
Symmetric functions capture general functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Generalized secure routerless routing
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
| Hi-index | 0.00 |
Elementary symmetric polynomials $S_n^k$ are the building blocks of symmetric polynomials. In this work we prove that for constant $k$'s, $S_n^k$ modulo composite numbers m=p1p2 can be computed using only no(1) multiplications if the coefficients of monomials xi1xi2. . . xik are allowed to be 1 either mod p1 or mod p2 but not necessarily both. To the best of our knowledge, no previous result yielded even a sublinear (i.e., $n^{\varepsilon}$, $0Comput. Complexity, 6 (1997), pp. 217--234], any homogeneous depth-3 circuit needs size $\Omega((n/2k)^{k/2})$ for computing $S_n^k$ modulo primes. Moreover, the number of multiplications in our algorithm remains sublinear while k=O(log log n). Our results generalize for other nonprime-power composite moduli as well. The proof uses perfect hashing functions and the famous BBR polynomial of Barrington, Beigel, and Rudich.