Threshold Circuits of Small Majority-Depth

Information and Computation

Volumn 146, Issue 1, 1998, Pages 55-83

  Maciel, Alexis ^a   Thérien, Denis ^b  

^a CLARKSON UNIVERSITY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346703293     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2732     Document Type: Article

References (36)

1. 1 formulae on finite structures, Ann. Pure Appl. Logic 24, 1-48.
2. Ajtai, M., and Ben-Or, M. (1984), A theorem on probabilistic constant depth computations, in "Proceedings, 16th ACM Symposium on Theory of Computing," pp. 471-474.
3. Alon, N., and Bruck, J. (1994), Explicit constructions of depth-2 majority circuits for comparison and addition, SIAM J. Discrete Math. 7, 1-8.
4. Barrington, D. A. (1986), "A Note on a Theorem of Razborov," Techn. Rep. COINS TR 87-93, Dept. of Computer Science, University of Massachusetts.
5. Beame, P. W., Cook, S. A., and Hoover, H. J. (1986), Log depth circuits for division and related problems, SIAM J. Comput. 15, 994-1003.
6. Beigel, R. (1993), The polynomial method in circuit complexity, in "Proceedings, 7th IEEE Structure in Complexity Theory Conference," pp. 82-95.
7. Beigel, R. (1994), When do extra majority gates help? polylog(n) majority gates are equivalent to one, Comput. Complexity 4, 314-324.
8. Beigel, R., and Tarui, J. (1994), On ACC, Comput. Complexity 4, 350-366.
9. Bruck, J. (1990), Harmonic analysis of polynomial threshold functions, SIAM J. Discrete Math. 3, 168-177.
10. 0 functions and spectral norms, in "Proceedings, 31st IEEE Symposium on Foundations of Computer Science," pp. 632-641.
11. Chandra, A. K., Stockmeyer, L., and Vishkin, U. (1984), Constant depth reducibility, SIAM J. Comput. 13, 423-439.
12. Denenberg, L., Gurevich, Y., and Shelah, S. (1986), Definability by Constant-Depth Polynomial-Size Circuits, Inform. and Control 70, 216-240.
13. Fagin, R., Klawe, M., Pippenger, N. J., and Stockmeyer, L. (1985), Bounded-depth polynomial-size circuits for symmetric functions, Theoret. Comput. Sci. 36, 239-250.
14. Furst, M., Saxe, J. B., and Sipser, M. (1984), Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory 17, 13-27.
15. Goldmann, M. (1992), "On Threshold Circuits and Related Models of Computation," Ph.D. thesis, Royal Institute of Technology, Stockholm, Sweden.
16. Goldmann, M., Håstad, J., and Razborov, A. (1992), Majority gates vs. general weighted threshold gates, Comput. Complexity 2, 277-300.
17. Goldmann, M., and Karpinski, M. (1993), Simulating threshold circuits by majority circuits, in "Proceedings, 25th ACM Symposium on Theory of Computing," pp. 551-560.
18. Hajnal, A., Maass, W., Pudlák, P., Szegedy, M., and Turán, G. (1993), Threshold circuits of bounded depth, J. Comput. System Sci. 46, 129-154.
19. Håstad, J. (1986), "Computational Limitations of Small Depth Circuits," MIT Press, Cambridge, MA.
20. Hofmeister, T., Hohberg, W., and Köhling, S. (1991), Some notes on threshold circuits, and multiplication in depth 4, Inform. Process. Lett. 39, 219-225.
21. 2," Res. Rep. 447, Lehrstuhl Informatik II, Universität Dortmund, Germany.
22. Immerman, N., and Landau, S. (1995), The complexity of iterated multiplication, Inform. and Comput. 116, 103-116.
23. Maciel, A. (1995), "Threshold Circuits of Small Majority-Depth," Ph.D. thesis, McGill University, Montréal, Québec, Canada.
24. 0 for free, in "Proceedings, 10th Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 665, pp. 545-554, Springer-Verlag, Berlin.
25. Papadimitriou, C. H., and Zachos, S. K. (1983), Two remarks on the power of counting, in "Proceedings, 6th GI Conference on Theoretical Computer Science," Lecture Notes in Computer Science, Vol. 145, pp. 269-275, Springer-Verlag, Berlin.
26. Razborov, A. A. (1987), Lower bounds for the size of circuits of bounded depth with basis { ∧, ⊕}, Math. Notes Acad. Sci. USSR 41, 333-338.
27. Reif, J. H. (1987), On threshold circuits and polynomial computation, in "Proceedings, 2nd IEEE Structure in Complexity Theory Conference," pp. 118-123.
28. Savage, J. E. (1976), "The Complexity of Computing," Wiley, New York.
29. Sipser, M. (1983), Borel sets and circuit complexity, in "Proceedings, 15th ACM Symposium on Theory of Computing," pp. 61-69.
30. Siu, K.-Y., and Bruck, J. (1991), On the power of threshold circuits with small weights, SIAM J. Discrete Math. 4, 423-435.
31. Siu, K.-Y., Bruck, J., Kailath, T., and Hofmeister, T. (1993), Depth-efficient neural networks for division and related problems, IEEE Trans. Inform. Theory 39, 946-956.
32. Siu, K.-Y., and Roychowdhury, V. (1994), On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7, 284-292.
33. Siu, K.-Y., Roychowdhury, V., and Kailath, T. (1991), Depth-size tradeoffs for neural computation, IEEE Trans. Comput. 40, 1402-1412.
34. Smolensky, R. (1987), Algebraic methods in the theory of lower bounds for Boolean circuit complexity, in "Proceedings, 19th ACM Symposium on Theory of Computing," pp. 77-82.
35. Yao, A. C.-C. (1985), Separating the polynomial-time hierarchy by oracles, in "Proceedings, 26th IEEE Symposium on Foundations of Computer Science," pp. 1-10.
36. Zhang, Z.-L., Barrington, D. A. M., Tarui, J. (1993), Computing symmetric functions with AND/OR circuits and a single MAJORITY gate, in "Proceedings, 10th Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 665, pp. 535-544, Springer-Verlag, Berlin.