{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T04:10:25Z","timestamp":1772511025026,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01200762","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:13:34Z","timestamp":1108728814000},"page":"297-299","source":"Crossref","is-referenced-by-count":35,"title":["Sensitivity vs. block sensitivity of Boolean functions"],"prefix":"10.1007","volume":"15","author":[{"given":"David","family":"Rubinstein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. A. Cook","year":"1986","unstructured":"S. A. Cook, C. Dwork, andR. Reischuk: Upper and lower time bounds for parallel random access machines without simultaneous writes,SIAM J. Computing 15 (1986), 87?97.","journal-title":"SIAM J. Computing"},{"key":"CR2","unstructured":"Anna G\ufffdl: Lower bounds for the complexity of reliable Boolean circuits with noisy gates, in:32nd IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico 1991, 594?601."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"N. Nisan: CREW PRAM's and decision trees, in:Proc 21th ACM Symposium on Theory of Computing, Seattle WA, 1989, 327?335.","DOI":"10.1145\/73007.73038"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"N. Nisan, andM. Szegedy: On the degree of Boolean functions as real polynomials, in:Proc. 24th ACM Symposium on Theory of Computing, Victoria, B.C., 1992, 462?467.","DOI":"10.1145\/129712.129757"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"H. U. Simon: A tight ?(loglogn) bound on the time for parallel RAM's to compute nondegenerate Boolean functions, in:FCT'83, Springer Lecture Notes in Computer Science158 (1983), 439?444.","DOI":"10.1007\/3-540-12689-9_124"},{"key":"CR6","first-page":"373","volume-title":"The complexity of Boolean functions","author":"I. Wegener","year":"1987","unstructured":"I. Wegener:The complexity of Boolean functions, Wiley and Teubner, Stuttgart, 1987. See 373?410."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200762.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200762\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:57:50Z","timestamp":1586120270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01200762"],"URL":"https:\/\/doi.org\/10.1007\/bf01200762","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}