Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
From MaRDI portal
Publication:2490262
DOI10.1016/j.jcss.2005.06.007zbMath1094.68008OpenAlexW2162153693MaRDI QIDQ2490262
Richard J. Lipton, Nayantara Bhatnagar, Parikshit Gopalan
Publication date: 28 April 2006
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2005.06.007
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Block-symmetric polynomials correlate with parity better than symmetric ⋮ A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] ⋮ On the modulo degree complexity of Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- A lower bound on the MOD 6 degree of the OR function
- Representing Boolean functions as polynomials modulo composite numbers
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
- On an irreducibility theorem of I. Schur
- Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $
- Communication Complexity
This page was built for publication: Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
