Lower bounds for approximations by low degree polynomials over Zm

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 184-187

  Alon, N ^a   Beigel, R ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; FUNCTION EVALUATION; POLYNOMIAL APPROXIMATION;

LOW DEGREE POLYNOMIALS; PARITY FUNCTION; RAMSEY THEORY;

BOOLEAN FUNCTIONS;

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

References (15)

1. Upper and lower bounds for some depth-3 circuit classes
2. On ACC
3. On the correlation of symmetric functions
4. A note on the power of majority gates and modular gates
5. Exponential sums and circuits with a single threshold gate and mod-gates
6. A weight-size trade-off for circuits with MOD m gates
7. Threshold circuits of bounded depth
8. On the power of small-depth threshold circuits
9. On the computational power of depth 2 circuits with threshold and modulo gates
10. Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in
11. Threshold Circuits of Small Majority-Depth
12. Threshold circuits of small majority-depth
13. Ω(log n) lower bounds on the size of depth 3 threshold circuits with AND gates at the bottom
14. Algebraic methods in the theory of lower bounds for boolean circuit complexity
15. On ACC and threshold circuits