{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:10:21Z","timestamp":1648973421767},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00217-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"243-268","source":"Crossref","is-referenced-by-count":3,"title":["Optimal bounds for the approximation of boolean functions and some applications"],"prefix":"10.1016","volume":"180","author":[{"given":"Alexander E.","family":"Andreev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea E.F.","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9D.P.","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00217-4_BIB1","series-title":"Proc. 35th IEEE-FOCS","first-page":"807","article-title":"Measure on small complexity classes, with applications for BPP","author":"Allender","year":"1994"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB2","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"issue":"169","key":"10.1016\/S0304-3975(96)00217-4_BIB3_1","first-page":"147","article-title":"The universal principle of self-correction","volume":"127","author":"Andreev","year":"1985","journal-title":"Mat. Sbornik"},{"issue":"1","key":"10.1016\/S0304-3975(96)00217-4_BIB3_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1070\/SM1986v055n01ABEH002997","volume":"55","author":"Andreev","year":"1986","journal-title":"Math. USSR Sbornik"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB4_1","first-page":"36","article-title":"On the complexity of the realization of partial Boolean functions by circuits of functional elements","volume":"1","author":"Andreev","year":"1989","journal-title":"Diskret. Mat."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB4_2","first-page":"251","volume":"1","author":"Andreev","year":"1989","journal-title":"J. Discrete Math. Appl."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB5","series-title":"Proc. XIII Annual Symp. on Theoretical Aspects of Computer Science (STACS'96)","first-page":"319","article-title":"Optimal bounds for the approximation of boolean functions and some applications (extended abstract)","volume":"Vol. 1046","author":"Andreev","year":"1996"},{"issue":"4","key":"10.1016\/S0304-3975(96)00217-4_BIB6","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to generate cryptographically strong sequences of pseudorandom bits","volume":"13","author":"Blum","year":"1984","journal-title":"J. SIAM"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB7","series-title":"Randomness and Computation","first-page":"1","article-title":"Pseudorandom generators and complexity classes","volume":"Vol. 5","author":"Boppana","year":"1989"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB8","first-page":"759","article-title":"The complexity of finite boolean functions","volume":"Vol. A","author":"Boppana","year":"1990"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB9","series-title":"Proc. the 36th IEEE- FOCS","article-title":"Pseudorandom generators, measure theory, and natural proofs","author":"Cai","year":"1995"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB10","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB11","volume":"Vol. I","author":"Feller","year":"1970"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","article-title":"A guided tour of Chernoff bounds","volume":"33","author":"Hagerup","year":"1990","journal-title":"IPL"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB13","series-title":"Topics in Computational Learning Theory","author":"Kearns","year":"1994"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB14","first-page":"1171","article-title":"About gating and contact-gating circuits","volume":"111","author":"Lupanov","year":"1956","journal-title":"Dokl Akad. Nauk SSSR"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB15","first-page":"31","article-title":"About a method circuits design-local coding principle","volume":"10","author":"Lupanov","year":"1965","journal-title":"Problemy Kibernet."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/TEC.1956.5219786","article-title":"Complexity in electronic switching circuits","volume":"5","author":"Mueller","year":"1956","journal-title":"IRE Trans. Electron Comput."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB17","first-page":"40","article-title":"About the complexity of gating circuits for the partial boolean matrix","volume":"163","author":"Nechiporuk","year":"1965","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7052.001.0001","article-title":"Using Hard Problems to Create Pseudorandom Generators","author":"Nisan","year":"1992"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB19","series-title":"presented also at the 29th IEEE FOCS","first-page":"149","article-title":"Hardness vs. randomness","volume":"49","author":"Nisan","year":"1994"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01683269","article-title":"Information theory and the complexity of Boolean functions","volume":"10","author":"Pippenger","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB21","series-title":"Proc. 26th ACM-STOC","first-page":"204","article-title":"Natural proofs","author":"Razborov","year":"1994"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal switching circuits","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell. Syst. Tech. J."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB23","first-page":"215","article-title":"About realization of partial boolean functions by circuits from functional elements","volume":"21","author":"Sholomov","year":"1969","journal-title":"Problemy Kibernet."},{"key":"10.1016\/S0304-3975(96)00217-4_BIB24","article-title":"The complexity of Finite Boolean Functions","author":"Wegener","year":"1987"},{"key":"10.1016\/S0304-3975(96)00217-4_BIB25","series-title":"Proc. 23th IEEE-FOCS","first-page":"80","article-title":"Theory and applications of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002174?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002174?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T20:40:34Z","timestamp":1580848834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596002174"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00217-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}