The correlation between parity and quadratic polynomials mod 3

Journal of Computer and System Sciences

Volumn 69, Issue 1, 2004, Pages 28-44

  Green, Frederic ^a  

^a CLARK UNIVERSITY   (United States)

Author keywords

Circuit complexity; Computational complexity; Lower bounds

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; MODAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; THRESHOLD LOGIC;

CIRCUIT COMPLEXITY; EXPONENTIAL SUM; LOWER BOUNDS; PARITY;

QUADRATIC PROGRAMMING;

EID: 2942704331     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.01.003     Document Type: Conference Paper

References (28)

1. E. Allender, A note on the power of threshold circuits, in: Proceedings of the 30th Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 580-584.
2. m, in: Sixteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 184-187.
3. Babai L., Nisan N., Szegedy M. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. System Sci. 45(2):1992;204-232.
4. 1 J. Comput. System Sci. 38:1989;150-164.
5. Barrington D.M., Straubing H. Complex polynomials and circuit lower bounds for modular counting. Comput. Complexity. 4:1994;325-338.
6. R. Beigel, A. Maciel, Upper and lower bounds for some depth-3 circuit classes, in: Proceedings of the 12th IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 149-157.
7. Beigel R., Tarui J. On ACC. Comput. Complexity. 4:1994;350-366.
8. Cai J.-Y. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. J. Comput. System Sci. 38:1989;68-85.
9. Cai J.-Y., Green F., Thierauf T. On the correlation of symmetric functions. Math. Systems Theory. 29:1996;245-258.
10. Furst M., Saxe J.B., Sipser M. Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory. 17:1984;13-27.
11. Goldmann M. A note on the power of majority gates and modular gates. Inform. Process. Lett. 53:1995;321-327.
12. Green F. Exponential sums and circuits with a single threshold gate and mod-gates. Theory Comput. Systems. 32:1999;453-466.
13. Green F. A complex-number fourier method for lower bounds on the Mod-m degree. Comput. Complexity. 9:2000;16-38.
14. Green F., Köbler J., Regan K., Schwentick T., Torán J. The power of the middle bit of a #P function. J. Comput. System Sci. 50:1995;456-467.
15. V. Grolmusz, A weight-size trade-off for circuits with mod m gates, in: Proceedings of the 26th ACM Symposium on Theory of Computing, Montréal, Quebec, 1994, pp. 68-74.
16. A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, G. Turán, Threshold circuits of bounded depth, in: Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1987, pp. 99-110.
17. Håstad J. Computational Limitations of Small-depth Circuits. 1987;The MIT Press, Cambridge.
18. Håstad J., Goldmann M. On the power of small-depth threshold circuits. Comput. Complexity. 1:1991;113-129.
19. M. Krause, P. Pudlák, On the computational power of depth 2 circuits with threshold and modulo gates, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM Press, New York, 1994, pp. 48-57.
20. Lidl R., Niederreiter H. Finite Fields. Encyclopedia of Mathematics and its Applications. Vol. 20:1983;Cambridge University Press, Cambridge.
21. Razborov A.A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki. 41:1987;598-607. (English translation in Math. Notes Acad. Sci. USSR 41 (1987) 333-338).
22. Razborov A.A. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mat. Zametki. 41:1987;598-607. (English translation in Math. Notes Acad. Sci. USSR 41 (1987) 333-338).
23. A.A. Razborov, S. Rudich, Natural proofs, in: Proceedings of the 26th ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1994, pp. 204-213.
24. Schmidt W.M. Equations Over Finite Fields: an Elementary Approach. Lecture Notes in Mathematics. Vol. 536:1976;Springer, New York.
25. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 77-82.
26. Toda S. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20:1991;865-877.
27. A.C. Yao, Separating the polynomial-time hierarchy by oracles, in: Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, OR, 1985, pp. 1-10.
28. A. Yao, On ACC and threshold circuits, in: Proceedings of the 31st Symposium on Foundations of Computer Science, St. Louis, MO, 1990, pp. 619-627.