{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:34Z","timestamp":1759637554397},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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,8]]},"DOI":"10.1016\/0020-0190(96)00105-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:22:55Z","timestamp":1027610575000},"page":"151-157","source":"Crossref","is-referenced-by-count":13,"title":["Sensitivity vs. block sensitivity (an average-case study)"],"prefix":"10.1016","volume":"59","author":[{"given":"A.","family":"Bernasconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00105-6_BIB1","article-title":"Sensitivity of Boolean functions, abstract harmonic analysis and circuit complexity","author":"Bernasconi","year":"1993","journal-title":"ICSI Tech. Rept. TR-93-030"},{"key":"10.1016\/0020-0190(96)00105-6_BIB2","series-title":"Proc. 21st STOC","first-page":"327","article-title":"CREW PRAMs and decision trees","author":"Nisan","year":"1989"},{"key":"10.1016\/0020-0190(96)00105-6_BIB3","article-title":"Sensitivity vs. block sensitivity of Boolean functions","author":"Kenyon","year":"1990","journal-title":"DIMACS Tech. Rept. 90-18"},{"issue":"2","key":"10.1016\/0020-0190(96)00105-6_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01200762","article-title":"Sensitivity vs. block sensitivity of Boolean functions","volume":"15","author":"Rubinstein","year":"1995","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(96)00105-6_BIB5","series-title":"FCT'83","article-title":"A tight \u03a9(log log n) bound on the time for parallel RAMs to compute nondegenerate Boolean functions","volume":"158","author":"Simon","year":"1983"},{"key":"10.1016\/0020-0190(96)00105-6_BIB6","article-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:52:41Z","timestamp":1555944761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0020019096001056"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00105-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}