Symmetric polynomials over ℤm and simultaneous communication protocols

Journal of Computer and System Sciences

Volumn 72, Issue 2, 2006, Pages 252-285

  Bhatnagar, Nayantara ^a   Gopalan, Parikshit ^a   Lipton, Richard J ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; NETWORK PROTOCOLS; NUMBER THEORY; PROBLEM SOLVING;

DIOPHANTINE EQUATIONS; SYMMETRIC POLYNOMIALS;

POLYNOMIALS;

EID: 32844465713     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.06.007     Document Type: Article

References (20)

1. D.A. Barrington, R. Beigel, and S. Rudich Representing Boolean functions as polynomials modulo composite numbers Comput. Complexity 4 1994 367 382
2. R. Beigel, The polynomial method in circuit complexity, Structures in Complexity Theory: Eighth Annual Conference, 1993, pp. 82-95.
3. R. Beigel, Personal communication, 2003.
4. A. Chandra, M. Furst, R.J. Lipton, Multi-party protocols, Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 94-99.
5. M. Filaseta A generalization of an irreducibility theorem of I. Schur Acta Arith. 58 3 1991 251 272
6. A. Granville, Arithmetic properties of binomial coefficients, Canadian Mathematical Society Conference Proceedings, vol. 20, 1997, pp. 253-275.
7. A. Granville abc means we can count squarefrees Internat. Math. Res. Notices 19 1998 1224 1231
8. A. Granville, and T.J. Tucker It's as easy as abc Notices AMS 49 10 2002 991 1009
9. F. Green Complex Fourier technique for lower bounds on the mod-m degree Comput. Complexity 9 2000 16 38
10. V. Grolmusz On the weak mod m representation of Boolean functions Chicago J. Theoret. Comput. Sci. 2 1995
11. V. Grolmusz Superpolynomial size set-systems with restricted intersections mod 6 and explicit ramsey graphs Combinatorica 20 1 2000 71 86
12. G.H. Hardy, and E.M. Wright An Introduction to the Theory of Numbers 1985 Clarendon Press Oxford
13. E. Kushilevitz, and N. Nisan Communication Complexity 1997 Cambridge University Press Cambridge
14. M. Minsky, and S. Papert Perceptrons: An Introduction to Computational Geometry 1968 MIT Press Cambridge, MA
15. A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {∧, ⊕}, Math. Notes Acad. Sci. USSR (41) (1987) 333-338.
16. R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the 19th Annual ACM Symposium on Theoretical Computer Science, 1987, pp. 77-82.
17. G. Tardos, and D. Barrington A lower bound on the mod 6 degree of the or function Comput. Complexity 7 1998 99 108
18. 0 functions and the polynomial-time hierarchy Theoret. Comput. Sci. 113 1993 167 183
19. m SIAM J. Discrete Math. 9 1996 55 62
20. A.C. Yao, Some complexity questions related to distributive computing, Proceedings of the 11th Annual ACM Symposium on Theory of Computation, 1979, pp. 209-213.