Symmetric polynomials over /spl Zopf//sub m/ and simultaneous communication protocols

We study the problem of representing symmetric Boolean functions as symmetric polynomials over /spl Zopf//sub m/. 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 [log/sub p/d] 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 /spl Omega/(n) on symmetric polynomials weakly representing classes of Mod/sub r/ and Threshold functions. We show there exist symmetric polynomials over /spl Zopf//sub m/ 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.

[1]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[2]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[3]  Gábor Tardos,et al.  A lower bound on the mod 6 degree of the OR function , 1998, computational complexity.

[4]  Shi-Chun Tsai,et al.  Lower Bounds on Representing Boolean Functions as Polynomials in Zm , 1996, SIAM J. Discret. Math..

[5]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[6]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[7]  A. Granville,et al.  It ’ s As Easy As abc , 2002 .

[8]  Frederic Green.  A complex-number Fourier technique for lower bounds on the Mod-m degree , 2000, computational complexity.

[9]  Michael Filaseta.  On an irreducibility theorem of I. Schur , 1991 .

[10]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[11]  Vince Grolmusz,et al.  Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs , 2000, Comb..

[12]  David A. Mix Barrington,et al.  Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.

[13]  Vince Grolmusz.  On the Weak mod m Representation of Boolean Functions , 1995, Chic. J. Theor. Comput. Sci..

[14]  R. Tennant.  Algebra , 1941, Nature.

[15]  Jun Tarui.  Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy , 1993, Theor. Comput. Sci..

[16]  T. N. Shorey,et al.  Exponential diophantine equations: Index , 1986 .

[17]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[18]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

[19]  Frederic Green.  Complex Fourier Technique for Lower Bounds on the Mod-m Degree Revised and Expanded Version of \lower Bounds for Depth-three Circuits with Equals and Mod-gates," in 12th Annual Symposium on Theoretical , .