{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T05:35:05Z","timestamp":1744695305595},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00237-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:46:25Z","timestamp":1027637185000},"page":"319-335","source":"Crossref","is-referenced-by-count":7,"title":["Can large fanin circuits perform reliable computations in the presence of faults?"],"prefix":"10.1016","volume":"240","author":[{"given":"R\u00fcdiger","family":"Reischuk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00237-6_BIB1","series-title":"Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity","first-page":"759","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB2","first-page":"59","article-title":"Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Probab. Inform. Trans."},{"key":"10.1016\/S0304-3975(99)00237-6_BIB3","first-page":"203","article-title":"Upper bound for the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Probab. Inform. Trans."},{"key":"10.1016\/S0304-3975(99)00237-6_BIB4","unstructured":"A. G\u00e1l, Lower bounds for the complexity of reliable boolean circuits with noisy gates, Proc. 32. IEEE Symp. on Foundations of Computer Science, FOCS\u201991, 1991, pp. 602\u2013611."},{"key":"10.1016\/S0304-3975(99)00237-6_BIB5","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/18.312190","article-title":"Lower bounds for the complexity of reliable boolean circuits with noisy gates","volume":"40","author":"G\u00e1l","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB6","doi-asserted-by":"crossref","unstructured":"M. Goldmann, J. H\u00e5stad, A. Razborov, Majority gates vs. general weighted threshold gates, Proc. 7. Structure in Complexity Theory, STRUCTURES\u201992, 1992, pp. 2\u201313.","DOI":"10.1007\/BF01200426"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB7","doi-asserted-by":"crossref","unstructured":"M. Goldmann, M. Karpinski, Simulating threshold circuits by majority circuits, Proc. 25. ACM Symp on the Theory of Computing, STOC\u201993, 1993, pp. 551\u2013560.","DOI":"10.1145\/167088.167234"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB8","first-page":"129","article-title":"Threshold circuits of bounded depth","volume":"46","author":"Hajnal","year":"1993","journal-title":"J. CSS"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB9","doi-asserted-by":"crossref","unstructured":"T. Hofmeister, A note on the simulation of exponential threshold weights, Proc. 2. Int. Conf. Computing and Combinatorics, COCOON\u201996, Springer, Lecture Notes in Computer Science, Vol. 1090, 1996, pp. 136\u2013141.","DOI":"10.1007\/3-540-61332-3_146"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB10","doi-asserted-by":"crossref","unstructured":"J. von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components, in: C. Shannon, J. McCarthy (Ed.), Automata Studies, Princeton University Press, 1956, Princeton, NJ, pp. 43\u201398.","DOI":"10.1515\/9781400882618-003"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB11","doi-asserted-by":"crossref","unstructured":"N. Pippenger, On Networks of noisy gates, Proc. 26. IEEE Symp. on Foundations of Computer Science, FOCS\u201985, 1985, pp. 30\u201338.","DOI":"10.1109\/SFCS.1985.41"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB12","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1145\/65950.77248","article-title":"Invariance of complexity measures for networks with unreliable gates","volume":"36","author":"Pippenger","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB13","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/18.79921","article-title":"On a lower bound for the redundancy of reliable networks with noisy gates","volume":"37","author":"Pippenger","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB14","doi-asserted-by":"crossref","unstructured":"R. Reischuk, B. Schmeltz, Area efficient methods to increase the reliability of boolean circuits, Proc. 6. GI-AFCET Symp. on Theoretical Aspects of Computer Science, STACS\u201989, Springer, Lecture Notes in Computer Science, Vol. 349, 1989, pp. 314\u2013326.","DOI":"10.1007\/BFb0028995"},{"key":"10.1016\/S0304-3975(99)00237-6_BIB15","unstructured":"R. Reischuk, B. Schmeltz, Reliable computation with noisy circuits, a general nlogn lower bound, Proc. 32. IEEE Symp. on Foundations of Computer Science, FOCS\u201991, 1991, pp. 594\u2013601."},{"key":"10.1016\/S0304-3975(99)00237-6_BIB16","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002376?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:49:30Z","timestamp":1580860170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002376"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00237-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}