{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:28:46Z","timestamp":1649060926179},"reference-count":23,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0020-0190(96)00120-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:27:49Z","timestamp":1027600069000},"page":"251-254","source":"Crossref","is-referenced-by-count":1,"title":["A size-depth trade-off for the analog computation of Boolean functions"],"prefix":"10.1016","volume":"59","author":[{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farrokh","family":"Vatan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00120-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(96)00120-2_BIB2","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0885-064X(92)90024-6","article-title":"PR \u2260 NCR","volume":"8","author":"Cucker","year":"1992","journal-title":"J. Complexity"},{"key":"10.1016\/0020-0190(96)00120-2_BIB3","series-title":"On the power of real Turing machines over binary inputs","author":"Cucker","year":"1994"},{"key":"10.1016\/0020-0190(96)00120-2_BIB4","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/0885-064X(92)90008-Y","article-title":"Two P-complete problems in the theory of reals","volume":"8","author":"Cucker","year":"1992","journal-title":"J. Complexity"},{"key":"10.1016\/0020-0190(96)00120-2_BIB5","first-page":"265","article-title":"The depth of Boolean functions","volume":"34","author":"Gashkov","year":"1978","journal-title":"Prob. Kibernetiki"},{"key":"10.1016\/0020-0190(96)00120-2_BIB6","first-page":"52","article-title":"The complexity of the realization of Boolean functions by networks of functional elements and by formulas in bases whose elements realize continuous functions","volume":"37","author":"Gashkov","year":"1980","journal-title":"Prob. Kibernetiki"},{"key":"10.1016\/0020-0190(96)00120-2_BIB7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF00993408","article-title":"Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers","volume":"18","author":"Goldberg","year":"1995","journal-title":"Machine Learning"},{"key":"10.1016\/0020-0190(96)00120-2_BIB8","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"541","article-title":"Size-depth tradeoffs for threshold circuits","author":"Impagliazzo","year":"1993"},{"key":"10.1016\/0020-0190(96)00120-2_BIB9_1","article-title":"A weak version of the Blum, Shub & Smale model","author":"Koiran","year":"1994","journal-title":"Tech. Rept. NC-TR-94-5, NeuroCOLT Technical Reports Series"},{"key":"10.1016\/0020-0190(96)00120-2_BIB9_2","series-title":"Proc. 34th IEEE Symp. on the Foundations of Computer Science","first-page":"486","author":"Koiran","year":"1993"},{"key":"10.1016\/0020-0190(96)00120-2_BIB10_1","series-title":"Theoretical Advances in Neural Computation and Learning","first-page":"127","article-title":"A comparison of the computational power of sigmoid and Boolean threshold circuits","author":"Maass","year":"1994"},{"key":"10.1016\/0020-0190(96)00120-2_BIB10_2","series-title":"Proc. 32nd IEEE Symp. on the Foundations of Computer Science","first-page":"767","author":"Maass","year":"1991"},{"key":"10.1016\/0020-0190(96)00120-2_BIB11","first-page":"275","article-title":"On the Betti numbers of real varieties","volume":"15","author":"Milnor","year":"1964"},{"key":"10.1016\/0020-0190(96)00120-2_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01270397","article-title":"Lower bounds for arithmetic networks","volume":"4","author":"Monta\u00f1a","year":"1993","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"10.1016\/0020-0190(96)00120-2_BIB13","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/inco.1994.1059","article-title":"Approximating threshold circuits by rational functions","volume":"112","author":"Paturi","year":"1994","journal-title":"Inform. and Comput."},{"issue":"12","key":"10.1016\/0020-0190(96)00120-2_BIB14","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1109\/12.106225","article-title":"Depth-size tradeoffs for neural computation","volume":"40","author":"Siu","year":"1991","journal-title":"IEEE Trans. Comput.: Special issue on Artificial Neural Networks"},{"issue":"2","key":"10.1016\/0020-0190(96)00120-2_BIB15","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/18.312168","article-title":"Rational approximation techniques for analysis of neural networks","volume":"40","author":"Siu","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(96)00120-2_BIB16","series-title":"Proc. 35th IEEE Symp. on the Foundations of Computer Science","first-page":"553","article-title":"On the computation of Boolean functions by analog circuits of bounded fan-in","author":"Tur\u00e1n","year":"1994"},{"key":"10.1016\/0020-0190(96)00120-2_BIB21","unstructured":"complete version in: J. Comput. System Sci., to appear."},{"key":"10.1016\/0020-0190(96)00120-2_BIB17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","article-title":"Lower bounds for approximation by non-linear manifolds","volume":"133","author":"Warren","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(96)00120-2_BIB18","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/0020-0190(96)00120-2_BIB19","series-title":"On the complexity of encoding in analog circuits","author":"Wegener","year":"1994"},{"key":"10.1016\/0020-0190(96)00120-2_BIB20","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1145\/322326.322342","article-title":"On parallel computation for the knapsack problem","volume":"29","author":"Yao","year":"1982","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:53:33Z","timestamp":1556643213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019096001202"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00120-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}