Size-depth trade-offs for threshold circuits

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.

	1	Ajtai M 1 #t-Formuleoe on Finite Structure#, Annals of Pure and Applied Logic, 24, pp 1-48, 1983.
	2	Paul W Beame , Stephen A Cook , H James Hoover, Log depth circuits for division and related problems, SIAM Journal on Computing, v.15 n.4, p.994-1003, Nov. 1986 [doi>10.1137/0215070]
	3	Blum, N. (1984), A Boolean Function requiring 3n Network Size, Theoretical Computer Science, 28, pp. 337-345.
	4	Ravi B. Boppana , Michael Sipser, The complexity of finite functions, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991
	5	Bruck, J. and Smolensky, R. (1990), Polynomial Threshold Functions, AC~ Functions and Spectral Norms, in "31st IEEE Symposium on Foundations of Computer Science", pp. 632- 641.
	6	Chandra, A. and Stockmeyer, L. (1984), Constant Depth Reducibility, SIAM Journal on Computing, 13, pp. 423-439.
	7	P. E. Dunne, The complexity of Boolean networks, Academic Press Professional, Inc., San Diego, CA, 1988
	8	Furst, M., Saxe, J.B. and Sipser, M. (1984), Parity, Circuits, and the Polynomial Time Hierarchy, Mathematical Systems Theory, 17', pp. 13-28.
	9	J Hastad, Almost optimal lower bounds for small depth circuits, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.6-20, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12132]
	10	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	11	Hinton, G.E. (1987), Connectionist Learning Procedures, CMU-CS-87-115.
	12	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 ]
	13	Minsky, M. and Papert, S.A. (1969), "Perceptrons", MIT Press, Cambridge, Massachusetts.
	14	Carver Mead, Analog VLSI and neural systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	15	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]
	16	Ian Parberry , Georg Schnitger, Parallel computation with threshold functions, Journal of Computer and System Sciences, v.36 n.3, p.278-302, June 1988 [doi>10.1016/0022-0000(88)90030-X]
	17	Ramamohan Paturi , Michael E. Saks, Approximating threshold circuits by rational functions, Information and Computation, v.112 n.2, p.257-272, Aug 1 1994 [doi>10.1006/inco.1994.1059 ]
	18	Raghavan, P., (1986), Probabilistic Construetion of Deterministic Algorithms: Approximating Packing Integer Programs, in "27th IEEE Symposium on Foundations of Computer Science", pp. 10-18.
	19	Red'kin, N.P. (1973), Proof of Minimality of Circuits consisting of Functional Elements, Problemy Kibernetika, 23, pp. 83-102 (in Russian) (Translation: Systems Theory Research, 23, pp. 85-103.)
	20	Razborov, A.A. (1986), Lower Bounds on the Size of Bounded Depth Networks over a Complete Basis with Logical Addition, Mathematische Zametki 41 pp. 598-607 (in Russian). English Translation inMathemaLical Notes of the Academy of Sciences of the USSR 41, pp. 333- 338.
	21	Reif, J. (1987), On Threshold Circuits and Polynomial Computations, in "Proceedings of 2nd Structure in Complexity Theory Conference", pp. 118-125.
	22	Siu, K., Roychowdury, V., and Kailath, T. (1990). Computing with Optimal Size Threshold Circuits, Technical Report, Stanford University.
	23	Siu, K.-Y, Bruck, J. and Kailath, T. Depth- Efficient Neural Networks for Division and Related Problems, IEEE Transactions on Information Theory, to appear.
	24	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]
	25	A. C. Yao, Circuits and local computation, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.186-196, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73025]
	26	Vao, A. C-C. (1990), On ACC and Threshold Circuits, in "31st IEEE Symposium on Foundations of Computer Science", pp. 619-627.