A size-depth trade-off for the analog computation of Boolean functions

Information Processing Letters

Volumn 59, Issue 5, 1996, Pages 251-254

  Turán, György ^a   Vatan, Farrokh ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Arithmetic threshold circuits; Boolean functions; Computational complexity; Size depth trade offs

Indexed keywords

EID: 0043041154     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00120-2     Document Type: Article

References (23)

1. L. Blum, M. Shub and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
2. ℝ, J. Complexity 8 (1992) 230-238.
3. F. Cucker and D. Grigoriev, On the power of real Turing machines over binary inputs, Manuscript, 1994.
4. F. Cucker and A. Torrecillas, Two P-complete problems in the theory of reals, J. Complexity 8 (1992) 454-466.
5. S.B. Gashkov, The depth of Boolean functions, Prob. Kibernetiki 34 (1978) 265-268 (in Russian).
6. S.B. Gashkov, The complexity of the realization of Boolean functions by networks of functional elements and by formulas in bases whose elements realize continuous functions, Prob. Kibernetiki 37 (1980) 52-118 (in Russian).
7. P. Goldberg and M. Jerrum, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Machine Learning 18 (1995) 131-148.
8. R. Impagliazzo, R. Paturi and M.E. Saks, Size-depth trade-offs for threshold circuits, in: Proc. 25th ACM Symp. on Theory of Computing (1993) 541-550.
9. P. Koiran, A weak version of the Blum, Shub & Smale model, Tech. Rept. NC-TR-94-5, NeuroCOLT Technical Reports Series, August 1994; A preliminary version appeared in: Proc. 34th IEEE Symp. on the Foundations of Computer Science (1993) 486-495.
10. P. Koiran, A weak version of the Blum, Shub & Smale model, Tech. Rept. NC-TR-94-5, NeuroCOLT Technical Reports Series, August 1994; A preliminary version appeared in: Proc. 34th IEEE Symp. on the Foundations of Computer Science (1993) 486-495.
11. W. Maass, G. Schnitger and E.D. Sontag, A comparison of the computational power of sigmoid and Boolean threshold circuits, in: V. Roychowdhury, K.-Y. Siu and A. Orlitsky, eds., Theoretical Advances in Neural Computation and Learning (Kluwer, Dordrecht, 1994) 127-151; A preliminary version appeared in: Proc. 32nd IEEE Symp. on the Foundations of Computer Science (1991) 767-776.
12. W. Maass, G. Schnitger and E.D. Sontag, A comparison of the computational power of sigmoid and Boolean threshold circuits, in: V. Roychowdhury, K.-Y. Siu and A. Orlitsky, eds., Theoretical Advances in Neural Computation and Learning (Kluwer, Dordrecht, 1994) 127-151; A preliminary version appeared in: Proc. 32nd IEEE Symp. on the Foundations of Computer Science (1991) 767-776.
13. J. Milnor, On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15 (1964) 275-280.
14. J.L. Montaña and L.M. Pardo, Lower bounds for arithmetic networks, Appl. Algebra Engrg. Comm. Comput. 4 (1993) 1-24.
15. R. Paturi and M. Saks, Approximating threshold circuits by rational functions, Inform. and Comput. 112 (1994) 257-272.
16. K.Y. Siu, V.P. Roychowdhury and T. Kailath, Depth-size tradeoffs for neural computation, IEEE Trans. Comput.: Special issue on Artificial Neural Networks 40 (12) (1991) 1402-1412.
17. K.Y. Siu, V.P. Roychowdhury and T. Kailath, Rational approximation techniques for analysis of neural networks, IEEE Trans. Inform. Theory 40 (2) (1994) 455-466.
18. Gy. Turán and F. Vatan, On the computation of Boolean functions by analog circuits of bounded fan-in, in: Proc. 35th IEEE Symp. on the Foundations of Computer Science (1994) 553-564; complete version in: J. Comput. System Sci., to appear.
19. Gy. Turán and F. Vatan, On the computation of Boolean functions by analog circuits of bounded fan-in, in: Proc. 35th IEEE Symp. on the Foundations of Computer Science (1994) 553-564; complete version in: J. Comput. System Sci., to appear.
20. H.E. Warren, Lower bounds for approximation by non-linear manifolds, Trans. Amer. Math. Soc. 133 (1968) 167-178.
21. I. Wegener, The Complexity of Boolean Functions (Teubner-Wiley, 1987).
22. I. Wegener, On the complexity of encoding in analog circuits, Preprint, 1994.
23. A.C. Yao, On parallel computation for the knapsack problem, J. ACM 29 (1982) 898-903.