{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:22:10Z","timestamp":1737091330690,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_47","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"539-553","source":"Crossref","is-referenced-by-count":3,"title":["Computing Boolean Functions from Multiple Faulty Copies of Input Bits"],"prefix":"10.1007","author":[{"given":"Mario","family":"Szegedy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"47_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"Noga Alon","year":"2000","unstructured":"N. Alon, J. Spencer, The Probabilistic Method, Wisley, New York (2000)."},{"key":"47_CR2","unstructured":"I. Benjamini, G. Kalai, O. Schramm, Noise sensitivity of Boolean functions and applications to percolation, math.PR\/9811157."},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0190(96)00105-6","volume":"59","author":"A. Bernasconi","year":"1996","unstructured":"A. Bernasconi, Sensitivity vs. block sensitivity (an average-case study), Information Processing Letters, 59 (1996) 151\u2013157.","journal-title":"Information Processing Letters"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"U. Feige, D. Peleg, P. Raghavan, E. Upfal, Computing with unreliable information, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (1990), 128\u2013137","DOI":"10.1145\/100216.100230"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/18.312190","volume":"40","author":"P. G\u00e1cs","year":"1994","unstructured":"P. G\u00e1cs, A. G\u00e1l, Lower bounds for the complexity of reliable Boolean circuits with noisy gates, IEEE Transactions on Information Theory, Vol.40, (1994) pp.579\u2013583.","journal-title":"IEEE Transactions on Information Theory"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"A. G\u00e1l, Lower bounds for the complexity of reliable Boolean circuits with noisy gates, Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (1991), 594\u2013601.","DOI":"10.1109\/SFCS.1991.185424"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"J. Kahn, G. Kalai, N. Linial, The in.uence of variables on boolean functions, Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988), 68\u201380","DOI":"10.1109\/SFCS.1988.21923"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129054190000023","volume":"1","author":"C. Kenyon","year":"1990","unstructured":"C. Kenyon, A. C. Yao, On evaluating boolean functions with unreliable tests, International Journal of Foundations of Computer Science 1, 1 (1990), 1\u201310.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"N. Nisan, M. Szegedy, On the degree of Boolean functions as real polynomials, Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing (1991), 419\u2013429.","DOI":"10.1145\/129712.129757"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1137\/0220062","volume":"20","author":"N. Nisan","year":"1991","unstructured":"N. Nisan, CREW PRAMs and decision trees, SIAM Journal on Computing, 20 (1991), 999\u20131007.","journal-title":"SIAM Journal on Computing"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"J. Von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components, In Automata Studies, C. E. Shannon and J. McCarthy, eds. Princeton University Press (1956), 329\u2013378.","DOI":"10.1515\/9781400882618-003"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"N. Pippenger, On networks of noisy gates, Proceedings of the 26th Annual Symposium on Foundations of Computer Science (1985), 30\u201338.","DOI":"10.1109\/SFCS.1985.41"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1145\/65950.77248","volume":"36","author":"N. Pippenger","year":"1989","unstructured":"N. Pippenger, Invariance of complexity measures for networks with unreliable gates, Journal of the ACM 36 (1989), 531\u2013539.","journal-title":"Journal of the ACM"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01200762","volume":"15","author":"D. Rubinstein","year":"1995","unstructured":"D. Rubinstein, Sensitivity vs. block sensitivity of Boolean functions, Combinatorica, 15 (1995) 297\u2013299.","journal-title":"Combinatorica"},{"key":"47_CR15","unstructured":"CPLEX, http:\/\/www.ilog.com \/products\/cplex\/"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T19:25:53Z","timestamp":1737055553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}