{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:17:30Z","timestamp":1781259450537,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00493-014-3189-x","type":"journal-article","created":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T12:48:56Z","timestamp":1452516536000},"page":"265-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Composition limits and separating examples for some boolean function complexity measures"],"prefix":"10.1007","volume":"36","author":[{"given":"Justin","family":"Gilmer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srikanth","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"3189_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.jcss.2007.06.020","volume":"74","author":"S. Aaronson","year":"2008","unstructured":"S. Aaronson: Quantum certificate complexity, J. Comput. Syst. Sci. 74 (2008), 313\u2013322.","journal-title":"J. Comput. Syst. Sci."},{"key":"3189_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"H. Buhrman and R. de Wolf: Complexity measures and decision tree complexity: a survey, Theor. Comput. Sci. 288 (2002), 21\u201343.","journal-title":"Theor. Comput. Sci."},{"key":"3189_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(86)90083-6","volume":"48","author":"S. Bublitz","year":"1986","unstructured":"S. Bublitz, U. Schurfeld and I. Wegener: Properties of complexity measures for PRAMs and WRAMs, Theor. Comput. Sci. 48 (1986), 53\u201373.","journal-title":"Theor. Comput. Sci."},{"key":"3189_CR4","volume-title":"Variations on the Sensitivity Con-jecture","author":"P. Hatami","year":"2011","unstructured":"P. Hatami, R. Kulkarni and D. Pankratov: Variations on the Sensitivity Con-jecture, Number 4 in Graduate Surveys, Theory of Computing Library, 2011."},{"key":"3189_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719512","volume-title":"Matrix analysis and applied linear algebra","author":"C. D. Meyer","year":"2000","unstructured":"C. D. Meyer: Matrix analysis and applied linear algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000."},{"key":"3189_CR6","volume-title":"Exact quantum query complexity for total boolean functions","author":"G. Midrijanis","year":"2004","unstructured":"G. Midrijanis: Exact quantum query complexity for total boolean functions, arXiv preprint quant-ph\/0403168, 2004."},{"key":"3189_CR7","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","volume":"20","author":"N. Nisan","year":"1991","unstructured":"N. Nisan: CREW PRAMs and Decision Trees, SIAM J. Comput. 20 (1991), 999\u20131007.","journal-title":"SIAM J. Comput."},{"key":"3189_CR8","volume-title":"A Rational Approach to the Theory of Graphs, Dover Books on Mathematics Series, Dover Publications","author":"E. R. Scheinerman","year":"2011","unstructured":"E. R. Scheinerman, D. H. Ullman and C. Berge: Fractional Graph Theory: A Rational Approach to the Theory of Graphs, Dover Books on Mathematics Series, Dover Publications, 2011."},{"key":"3189_CR9","doi-asserted-by":"crossref","unstructured":"A. Tal: Properties and applications of boolean function composition, Electronic Col-loquium on Computational Complexity (ECCC) 19 2012.","DOI":"10.1145\/2422436.2422485"},{"key":"3189_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1145\/2422436.2422485","volume-title":"ITCS","author":"A. Tal","year":"2013","unstructured":"A. Tal: Properties and applications of boolean function composition, in: ITCS (2013), 441\u2013454."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3189-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3189-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3189-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T12:40:26Z","timestamp":1692189626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3189-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["3189"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3189-x","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,11]]}}}