{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:13:57Z","timestamp":1725732837170},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_9","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"104-110","source":"Crossref","is-referenced-by-count":1,"title":["Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Morizumi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Ambainis, A., Gao, Y., Mao, J., Sun, X., Zuo, S.: New upper bound on block sensitivity and certificate complexity in terms of sensitivity. CoRR abs\/1306.4466 (2013)"},{"key":"9_CR2","first-page":"116","volume":"18","author":"A. Ambainis","year":"2011","unstructured":"Ambainis, A., Sun, X.: New separation between s(f) and bs(f). Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 116 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM\u00a048(4), 778\u2013797 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci.\u00a0288(1), 21\u201343 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","first-page":"1","volume":"2","author":"P. Hatami","year":"2011","unstructured":"Hatami, P., Kulkarni, R., Pankratov, D.: Variations on the sensitivity conjecture. Theory of Computing, Graduate Surveys\u00a02, 1\u201327 (2011)","journal-title":"Theory of Computing, Graduate Surveys"},{"key":"9_CR6","first-page":"163","volume":"20","author":"R. Impagliazzo","year":"2013","unstructured":"Impagliazzo, R., Kabanets, V.: Fourier concentration from shrinkage. Electronic Colloquium on Computational Complexity (ECCC)\u00a020, 163 (2013)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ic.2002.12.001","volume":"189","author":"C. Kenyon","year":"2004","unstructured":"Kenyon, C., Kutin, S.: Sensitivity, block sensitivity, and l-block sensitivity of boolean functions. Inf. Comput.\u00a0189(1), 43\u201353 (2004)","journal-title":"Inf. Comput."},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1137\/0220062","volume":"20","author":"N. Nisan","year":"1991","unstructured":"Nisan, N.: CREW PRAMs and decision trees. SIAM J. Comput.\u00a020(6), 999\u20131007 (1991)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01200762","volume":"15","author":"D. Rubinstein","year":"1995","unstructured":"Rubinstein, D.: Sensitivity vs. block sensitivity of boolean functions. Combinatorica\u00a015(2), 297\u2013299 (1995)","journal-title":"Combinatorica"},{"issue":"9","key":"9_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.ipl.2011.02.001","volume":"111","author":"M. Virza","year":"2011","unstructured":"Virza, M.: Sensitivity versus block sensitivity of boolean functions. Inf. Process. Lett.\u00a0111(9), 433\u2013435 (2011)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:13:22Z","timestamp":1558977202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}