On the computational power of depth 2 circuits with threshold and modulo gates

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	A89	Allender,E.: A note on the power of threshold circuits, Proceedings der 30. IEEE Symposium FOCS, 1989, 580-584.
	AB91	Alon,N.,J.Bruck: Explicit constructions of depth-2 majority circuits for comparison and addition, Technical Report RJ 8300 (75661) of the IBM Almaden Research Center, San Jose, 1991.
	ABFR91	James Aspnes , Richard Beigel , Merrick Furst , Steven Rudich, The expressive power of voting polynomials, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.402-409, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103461]
	Ba92	Barrington,D.A: Quasipolynomial size circuits. Proc. IEEE Conference Structure in Complexity, 1992, 86-93.
	Be92	Beigel,R.: Perceptrons, PP, and the Polynomial Hierarchy. Proc. of SCT'92, 14-19.
	Be93	Beigel,R.: The polynomial method in circuit complexity SCT'93, 82-95.
	B90	Bruek,J.: Harmonic analysis of polynomial threshold functions, SIAM Journal of Discrete Mathematics, 3, Nr. 22, 1990, 168-177.
	BKS92	Bruck,J.,Th.Hofmeister,Th.Kailath,K.Y.Siu: Depth efficient networks for division and related problems. Technical Report 1992, to appear in 1993.
	BS90	Bruck,J.,R.Smolensky: Polynomial threshold functions, AC~-functions and spectral norms Proc. 31th IEEE Conference FOCS, 1990, 632-641.
	G93	Goldmann,M.: A note on the power of majority gates and modular gates, preprint, 1993.
	GHR92	Goldmann,M.,J.H~stad,A.A.Razborov: Majority Gates versus general weighted threshold gates, J. of Computational Complexity 2 (1992), 277-300.
	GK93	Mikael Goldmann , Marek Karpinski, Simulating threshold circuits by majority circuits, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.551-560, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167234]
	HR89	Torben Hagerup , C. Rüb, A guided tour of Chernoff bounds, Information Processing Letters, v.33 n.6, p.305-308, February 1990 [doi>10.1016/0020-0190(90)90214-I]
	HMPST87	ttaj nal,A.,W.Maass,P.Pudlhk,M.Szegedy, G.Turgm: Threshold circuits of bounded depth, Proc. 28th IEEE Conf. FOCS, 1987, 99-110.
	HHK91	Thomas Hofmeister , Walter Hohberg , Susanne Köhling, Some notes on threshold circuits, and multiplication in depth 4, Information Processing Letters, v.39 n.4, p.219-225, Aug. 30, 1991 [doi>10.1016/0020-0190(91)90183-I]
	LMN89	Linial,N.,Y.Mansour,N.Nisan: Constant Depth Circuits, Fourier Transforms, and Learnability. Proc. 30th IEEE Conference FOCS, 1990.
	KORS91	V. Roychowdhury , K. Y. Siu , A. Orlitsky , T. Kailath, A geometric approach to threshold circuit complexity, Proceedings of the fourth annual workshop on Computational learning theory, p.97-111, August 05-07, 1991, Santa Cruz, California, United States
	K90	Krause,M. Geometric Arguments yield better bounds for threshold circuits and distributed computing. Proc. of SCT'91,314-322.
	KW91	Matthias Krause , Stephan Waack, Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in, Proceedings of the 32nd annual symposium on Foundations of computer science, p.777-782, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185448]
	MSS91	Wolfgang Maass , Georg Schnitger , Eduardo D. Sontag, On the computational power of sigmoid versus boolean threshold circuits (extended abstract), Proceedings of the 32nd annual symposium on Foundations of computer science, p.767-776, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185447]
	MP68	Minsky, M.,S.Papert: Perceptrons MIT Press, Cambridge 1988 Expanded edition. First edition appeared in 1968.
	R87	Razborov, A.A: Lower bounds for the size of circuits of bounded depth with basis {#, A}, Journal Math. Zametki. 41, 1987, 598-607.
	S87	R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.77-82, January 1987, New York, New York, United States [doi>10.1145/28395.28404]
	T91	Jun Tarui, Randomized polynomials, threshold circuits, and the polynomial hierarchy, Proceedings of the 8th annual symposium on Theoretical aspects of computer science, p.238-250, February 1991, Hamburg, Germany
	Ts93	Tsai,S.-C.: Lower bounds on representing boolean functions as polynomials. SCT'93, 96-101.
	YP94	P. Y. Yan , Ian Parberry, Exponential size lower bounds for some depth three circuits, Information and Computation, v.112 n.1, p.117-130, July 1994 [doi>10.1006/inco.1994.1054]
	Y90	Yao,A.C.: On A CC and Threshold Circuits, Proc. 31th IEEE Conference FOCS, 1990, 619-628.