Exponential sums and circuits with a single threshold gate and mod-gates

Theory of Computing Systems

Volumn 32, Issue 4, 1999, Pages 453-466

  Green, F ^a  

^a CLARK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL FUNCTIONS; THRESHOLD ELEMENTS; TIMING CIRCUITS;

EXPONENTIAL SUMS; LOWER BOUNDS; SUB-CIRCUITS; SYMMETRIC FUNCTIONS; SYMMETRY CONDITIONS; THRESHOLD GATES;

COMPUTER CIRCUITS;

EID: 0033417012     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000126     Document Type: Article

References (24)

1. G. I. Arhipov, A. A. Karacuba, and V. N. Cubarikov, Multiple Trigonometric Sums, Proceedings of the Steklov Institute of Mathematics, vol. 151, American Mathematical Society, Providence, 1982.
2. E. Allender, A note on the power of threshold circuits, Proceedings of the 30th Symposium on Foundations of Computer Science (1989), pp. 580-584.
3. 1, Journal of Computer and System Sciences, 38 (1989), 150-164.
4. D. A. M. Barrington, R. Beigel, and S. Rudich, Representing Boolean functions as polynomials modulo composite numbers, Computational Complexity, 4 (1994), 367-382.
5. R. Beigel and J. Tarui, On ACC, Computational Complexity, 4 (1994), 350-366.
6. 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.
7. J.-Y. Cai, F. Green, and T. Thierauf, On the correlation of symmetric functions. Mathematical Systems Theory, 29 (1996), 245-258.
8. M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17 (1984), 13-27.
9. F. Green, J. Köhler, K. Regan, T. Schwentick, and J. Torán, The power of the middle bit of a #P function. Journal of Computer and System Sciences, 50 (1995), 456-467.
10. M. Goldmann, A note on the power of majority gates and modular gates, Information Processing Letter, 53 (1995), 321-327.
11. PH, Information Processing Letters, 37 (1991), 149-153.
12. J. Håstad, Computational Limitations of Small-Depth Circuits, MIT Press, Cambridge, MA, 1987.
13. J. Håstad and M. Goldmann, On the power of small-depth threshold circuits, Computational Complexity, 1 (1991), 113-129.
14. A. Hajnal, W. Maass, P. Pudlák, M. Szegedy, and G. Turán, Threshold circuits of bounded depth, Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, (1987), pp. 99-110.
15. N. Katz, Sommes exponentielles, Astérisque, 79 (1980).
16. M. Krause and P. Pudlák, On the computational power of depth 2 circuits with threshold and modulo gates, Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, (1994), pp. 48-57.
17. R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, vol. 20, Cambridge University Press, Cambridge, 1983.
18. 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 in Mathematical Notes of the Academy of Sciences of the USSK, 41 (1987), 333-338.
19. 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 in Mathematical Notes of the Academy of Sciences of the USSK, 41 (1987), 333-338.
20. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach, Lecture Notes in Mathematics, vol. 536, Springer-Verlag, New York, 1976.
21. 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.
22. S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM Journal on Computing, 20 (1991), 865-877.
23. 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.
24. A. Yao, On ACC and threshold circuits, Proceedings of the 31st Symposium on Foundations of Computer Science (1990), pp. 619-627.