Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Diophantine Equations:
TR04-022 | 31st March 2004
Nayantara Bhatnagar, Parikshit Gopalan

The Degree of Threshold Mod 6 and Diophantine Equations

We continue the study of the degree of polynomials representing threshold functions modulo 6 initiated by Barrington, Beigel and Rudich. We use the framework established by the authors relating representations by symmetric polynomials to simultaneous protocols. We show that proving bounds on the degree of Threshold functions is equivalent to ... more >>>

ISSN 1433-8092 | Imprint