{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T12:40:30Z","timestamp":1736253630961,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540555536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0035163","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:20:01Z","timestamp":1138202401000},"page":"24-31","source":"Crossref","is-referenced-by-count":0,"title":["On Boolean decision trees with faulty nodes"],"prefix":"10.1007","author":[{"given":"Claire","family":"Kenyon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Uriel Feige, David Peleg, Prabhakar Raghavan and Eli Upfal. Computing with Noisy Information, 22nd Annual ACM Symposium on Theory of Computing, 1990, 128\u2013137.","DOI":"10.1145\/100216.100230"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Uriel Feige, David Peleg, Prabhakar Raghavan and Eli Upfal. Computing with Noisy Information, unpublished manuscript (1991).","DOI":"10.1145\/100216.100230"},{"issue":"1","key":"3_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054190000023","volume":"1","author":"C. Kenyon","year":"1990","unstructured":"Claire Kenyon and Andrew 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":"3_CR4","doi-asserted-by":"crossref","unstructured":"William Feller. An Introduction to Probability Theory and its Applications, Volume 1, Wiley and Sons 1957.","DOI":"10.1515\/jbnst-1958-1700125"},{"key":"3_CR5","unstructured":"Anna Gal Lower Bounds for the Complexity for Reliable Boolean Circuits with Noisy Gates, FOCS '91."},{"key":"3_CR6","unstructured":"N. Nisan CREW PRAMs and Decision Trees STOC '89."},{"key":"3_CR7","unstructured":"N. Pippenger On Networks of Noisy Gates FOCS '85."},{"key":"3_CR8","unstructured":"R. Reischuk and B. Schmeltz. Reliable Computation with Noisy Circuits and Decision Trees \u2014 A General n log n Lower Bound, FOCS '91."}],"container-title":["Lecture Notes in Computer Science","Theory of Computing and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035163.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:50:24Z","timestamp":1736250624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540555536"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0035163","relation":{},"subject":[]}}