Simulating threshold circuits by majority circuits

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 230-246

  Goldmann, Mikael ^a,b   Karpinski, Marek ^b,c  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF BONN   (Germany)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Circuit complexity; Majority circuits; Threshold circuits

Indexed keywords

EID: 0013416929     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794274519     Document Type: Article

References (34)

1. E. ALLENDER, A note on the power of threshold circuits, in Proc. 30th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 580-584.
2. N. ALON AND R. B. BOPPANA, The monotone, circuit complexity of boolean functions, Combinatorica, 7 (1987), pp. 1-22.
3. N. ALON AND J. BRUCK, Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition, Tech. Report RJ 8300 (75661), IBM Research Division, 1991. SIAM J. Discrete Math., 7 (1994), pp. 1-8.
4. P. W. BEAME, S. A. COOK, AND H. J. HOOVER, Log depth circuits for division and related problems, SIAM J. Comput., 15 (1986), pp. 994-1003.
5. R. BEIGEL AND J. TARUI, On ACC, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 783-792.
6. J. BRUCK, Harmonic analysis of polynomial threshold functions, SIAM J. Discrete Math., 3 (1990), pp. 168-177.
7. 0 functions and spectral norms, in Proc. 31st IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 632-641.
8. A. CHANDRA, L. STOCKMEYER, AND U. VISHKIN, Constant depth reducibility, SIAM J. Comput., 13 (1984), pp. 423-439.
9. S. A. COOK, A taxonomy of problems with fast parallel algorithms, Inform. and Control, 64 (1985), pp. 2-22.
10. M. GOLDMANN, J. HÅSTAD, AND A. RAZBOROV, Majority gates versus general weighted threshold gates, Comput. Complexity, 2 (1992), pp. 277-300.
11. A. HAJNAL, W. MAASS, P. PUDLÁK, M. SZEGEDY, AND G. TURÁN, Threshold circuits of bounded depth, in Proc. 28th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, 1987, pp. 99-110.
12. J. HÅSTAD, On the size of weights for threshold gates, SIAM. J. Disc. Math., 7 (1994), pp. 484-492.
13. J. HÅSTAD AND M. GOLDMANN. On the power of small-depth threshold circuits, Comput. Complexity, 1 (1991), pp. 113-129.
14. 2, Research Report 447, Department of Computer Science, University of Dortmund, 1992.
15. R. IMPAGLIAZZO, R. PATURI, AND M. SAKS, Size-depth trade-offs for threshold circuits, in Proc. 25th ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 541-550.
16. S. MUROGA, Threshold Logic and its Applications, Wiley-Interscience, New York, 1971.
17. J. MYHILL AND W. H. KAUTZ, On the size of weights required for linear-input switching functions, IRE Trans. Electron. Comput., EC-10 (1961), pp. 288-290.
18. P. ORPONEN, Neural networks and complexity theory, in Proc. 17th Internat. Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 629, Springer-Verlag, Berlin, 1992, pp. 50-61.
19. I. PARBERRY, A primer on the complexity theory of neural networks, in Formal Techniques in Artificial Intelligence: A Sourcebook, Stud. Comput. Sci. Artif. Intell. 6, North-Holland, Amsterdam, 1990, pp. 217-268.
20. I. PARBERRY AND G. SCHNITGER, Parallel computation with threshold functions, J. Comput. System Sci., 36 (1988), pp. 278-302.
21. N. PIPPENGER, The complexity of computation by networks, IBM J. Res. Develop., 31 (1987), pp. 235-243.
22. A. A. RAZBOROV, On small depth threshold circuits, in Proc. 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 621, Springer-Verlag, New York, 1992, pp. 42-52.
23. Ω(log n) lower bounds on the size of depth 3 threshold circuits with AND gates at the bottom, Inform. Process. Lett., 45 (1993), pp. 303-307.
24. W. L. RUZZO, On uniform circuit complexity, J. Comput. System Sci., 22 (1981), pp. 365-383.
25. K. Y. SIU AND J. BRUCK, On the power of threshold circuits with small weights, SIAM J. Discrete Math., 4 (1991), pp. 423-435.
26. K. Y. SIU, J. BRUCK, T. KAILATH, AND T. HOFMEISTER, Depth-efficient Neural Networks for Division and Related Problems, Tech. Report RJ 7946, IBM Research Division, 1991. IEEE Trans. Inform. Theory, 39 (1993), pp. 946-956.
27. K. Y. SIU AND V. ROYCHOWDHURY, On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math., 7 (1994), pp. 284-292.
28. K. Y. SIU, V. ROYCHOWDHURY, AND T. KAILATH, Computing with Optimal Size Threshold Circuits, Tech. Report, Stanford University, 1990.
29. S. TODA, On the computational power of PP and ⊗P, in Proc. 30th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, 1989, pp. 514-519.
30. J. TORÁN, An oracle characterization of the counting hierarchies, in Proc. 3rd Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 213-223.
31. J. TORÁN, A combinatorial technique for separating counting complexity classes, in Proc. 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 372, Springer-Verlag, New York, 1989, pp. 732-744.
32. K. W. WAGNER, The complexity of combinatorial problems with succinct input representation, Acta Inform., 23 (1986), pp. 325-356.
33. I. WEGENER, Optimal lower bounds on the depth of polynomial size threshold circuits for some arithmetic functions, Inform. Process. Lett., 46 (1993), pp. 85-87.
34. A. C. YAO, On ACC and threshold circuits, in Proc. 31st IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 619-627.