Symmetric Polynomials over Z_m and Simultaneous Communication Protocols (2003) [4 citations — 3 self]
http://www.cc.gatech.edu/~nand/PS/sym.ps
http://www.cc.gatech.edu/~parik/RESEARCH/conf.pdf
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Nayantara Bhatnagar and Parikshit Gopalan and Richard J. Lipton},
title = {Symmetric Polynomials over Z_m and Simultaneous Communication Protocols},
booktitle = {Proceedings of the 44 th Annual Symposium on the Foundations of Computer Science},
year = {2003},
pages = {03--047}
}
Bookmarks
OpenURL
Abstract:
We study the problem of representing symmetric Boolean functions as symmetric polynomials over Zm . We show an equivalence between such representations and simultaneous communication protocols. Computing a function f on 0 1 inputs with a polynomial of degree d modulo pq is equivalent to a two player simultaneous protocol for computing f where one player is given the first dlog p de digits of the weight in base p and the other is given the first dlog q de digits of the weight in base q. This reduces the problem of proving bounds on the degree of symmetric polynomials to proving bounds on simultaneous communication protocols. We use this equivalence to show lower bounds of on symmetric polynomials weakly representing classes of Mod r and Threshold functions. Previously the best known lower bound for symmetric polynomials weakly representing any function over Zm was n [1] where t is the number of distinct prime factors of m. We show there exist symmetric polynomials over Zm of degree o(n) strongly representing Threshold c for c constant, using the fact that the number of solutions of certain exponential Diophantine equations are finite. Conversely, the fact that the degree is o(n) implies that some classes of Diophantine equations can have only finitely many solutions. Our results give simplifications of many previously known results and show that polynomial representations are intimately related to certain questions in number theory.
