On the correlation of symmetric functions

Theory of Computing Systems

Volumn 29, Issue 3, 1996, Pages 245-258

  Cai, Jin Yi ^a   Green, F ^b   Thierauf, T ^c  

^a the State University of New York   (United States)

^b CLARK UNIVERSITY   (United States)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

CLOSED FORM; PARITY FUNCTIONS; SMALL FANS; SYMMETRIC BOOLEAN FUNCTIONS; SYMMETRIC FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 0000314868     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01201278     Document Type: Article

References (16)

1. 1-formulae on finite structures, Annals of Pure and Applied Logic 24 (1983), 1-48.
2. L. Babai, A random oracle separates PSPACE from the polynomial-time hierarchy, Information Processing Letters 26 (1987), 51-53.
3. D. M. Barrington, R. Beigel, and S. Rudich, Representing Boolean functions as polynomials modulo composite numbers, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 455-461.
4. J.-Y. Cai, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy Journal of Computer and System Science 38 (1989), 68-85.
5. M. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory 17 (1984), 13-27.
6. PH, Information Processing Letters 37 (1991), 149-153.
7. J. Håstad, Computational Limitations of Small-Depth Circuits, MIT Press, Cambridge, MA, 1987.
8. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, 2nd edn., Springer-Verlag, New York, 1990.
9. N. Katz, Sommes Exponentielles, Astérisque 79 (1980).
10. A. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Matematicheskie Zametki 41 (1987), 598-607. English translation: Mathematical Notes of the Academy of Sciences of the USSR 41 (1987), 333-338.
11. A. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Matematicheskie Zametki 41 (1987), 598-607. English translation: Mathematical Notes of the Academy of Sciences of the USSR 41 (1987), 333-338.
12. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach, Lecture Notes in Mathematics, vol. 536, Springer-Verlag, New York, 1976.
13. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 77-82.
14. C. Smorynski, Logical Number Theory, Vol. I, Springer-Verlag, New York, 1991.
15. A. C. Yao, Separating the polynomial-time hierarchy by oracles. Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 1-10.
16. n). Annals Universitatis Mariae Curie-Sklodowska Sectio A 10 (1956), 37-47.