The correlation between parity and quadratic polynomials mod 3

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 65-72

  Green, Frederic ^a  

^a CLARK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036292418     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. m
2. A note on the power of threshold circuits
3. 1
4. Upper and lower bounds for some depth-3 circuit classes
5. Multi-party protocols, pseudorandom generators for logspace, and time-space trade-offs
6. Complex polynomials and circuit lower bounds for modular counting
7. On ACC
8. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
9. On the correlation of symmetric functions
10. Parity, circuits, and the polynomial-time hierarchy
11. A note on the power of majority gates and modular gates
12. The power of the middle bit of a #P function
13. Exponential sums and circuits with a single threshold gate and mod-gates
14. A complex-number fourier method for lower bounds on the Mod-m degree
15. A weight-size trade-off for circuits with mod m gates
16. On the power of small-depth threshold circuits
17. Threshold circuits of bounded depth
18. On the computational power of depth 2 circuits with threshold and modulo gates
19. Lower bounds on the size of bounded depth networks over a complete basis with logical addition
20. Natural proofs
21. Equations over finite fields: An elementary approach
22. Algebraic methods in the theory of lower bounds for Boolean circuit complexity
23. PP is as hard as the polynomial-time hierarchy
24. Separating the polynomial-time hierarchy by oracles
25. On ACC and threshold circuits