{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:21:52Z","timestamp":1764350512312,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:00:00Z","timestamp":1565395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:00:00Z","timestamp":1565395200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-NRFF2013-13"],"award-info":[{"award-number":["NRF-NRFF2013-13"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-12-BS02-005"],"award-info":[{"award-number":["ANR-12-BS02-005"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"crossref","award":["ERC-AG-PE6"],"award-info":[{"award-number":["ERC-AG-PE6"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00224-019-09935-x","type":"journal-article","created":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T05:05:23Z","timestamp":1565413523000},"page":"101-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quadratically Tight Relations for Randomized Query Complexity"],"prefix":"10.1007","volume":"64","author":[{"given":"Rahul","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Klauck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srijita","family":"Kundu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troy","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swagato","family":"Sanyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jevg\u0113nijs","family":"Vihrovs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,10]]},"reference":[{"issue":"3","key":"9935_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jcss.2007.06.020","volume":"74","author":"S Aaronson","year":"2008","unstructured":"Aaronson, S.: Quantum certificate complexity. J. Comput. Syst. Sci. 74(3), 313\u2013322 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"9935_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Ben-David, S., Kothari, R.: Separations in query complexity using cheat sheets. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC\u201916, pp. 863\u2013876. ACM, New York (2016)","DOI":"10.1145\/2897518.2897644"},{"key":"9935_CR3","unstructured":"Ambainis, A., Kokainis, M., Kothari, R.: Nearly optimal separations between communication (or query) complexity and partitions. In: Proceedings of the 31St Conference on Computational Complexity, CCC\u201916, pp. 4:1\u20134:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Germany (2016)"},{"issue":"4","key":"9935_CR4","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 48(4), 778\u2013797 (2001)","journal-title":"J. ACM"},{"key":"9935_CR5","doi-asserted-by":"crossref","unstructured":"Blum, M., Impagliazzo, R.: Generic oracles and oracle classes. In: Proceedings of the 28th annual symposium on foundations of computer science, SFCS\u201987, pp. 118\u2013126. IEEE Computer Society, Washington (1987)","DOI":"10.1109\/SFCS.1987.30"},{"issue":"1","key":"9935_CR6","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. 288(1), 21\u201343 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9935_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00493-014-3189-x","volume":"36","author":"J Gilmer","year":"2016","unstructured":"Gilmer, J., Saks, M., Srinivasan, S.: Composition limits and separating examples for some Boolean function complexity measures. Combinatorica 36(3), 265\u2013311 (2016)","journal-title":"Combinatorica"},{"key":"9935_CR8","unstructured":"Harsha, P., Jain, R., Radhakrishnan, J.: Partition bound is quadratically tight for product distributions. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 135:1\u2013135:13, Dagstuhl, Germany. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2016)"},{"key":"9935_CR9","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Hemachandra, L.A.: One-way functions, robustness, and non-isomorphism of NP-complete sets. In: Proceedings of 2nd Structure in Complexity Theory, pp. 160\u2013173 (1987)","DOI":"10.1109\/PSCT.1987.10319267"},{"key":"9935_CR10","doi-asserted-by":"crossref","unstructured":"Jain, R., Klauck, H.: The partition bound for classical communication complexity and query complexity. In: Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity, CCC\u201910, pp. 247\u2013258. IEEE Computer Society, Washington (2010)","DOI":"10.1109\/CCC.2010.31"},{"key":"9935_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/cjtcs.2016.008","volume":"8","author":"R Kulkarni","year":"2016","unstructured":"Kulkarni, R., Tal, A.: On fractional block sensitivity. Chicago Journal Of Theoretical Computer Science 8, 1\u201316 (2016)","journal-title":"Chicago Journal Of Theoretical Computer Science"},{"key":"9935_CR12","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Crew prams decision trees. In: Proceedings of the twenty-first annual ACM symposium on theory of computing, STOC\u201989, pp. 327\u2013335. ACM, New York (1989)","DOI":"10.1145\/73007.73038"},{"key":"9935_CR13","doi-asserted-by":"crossref","unstructured":"Tal, A.: Properties and applications of Boolean function composition. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS\u201913, pp. 441\u2013454. ACM, New York (2013)","DOI":"10.1145\/2422436.2422485"},{"key":"9935_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02125350","volume":"9","author":"G Tardos","year":"1990","unstructured":"Tardos, G.: Query complexity or why is it difficult to separate NP A \u2229coNP A from P A by a random oracle. Combinatorica 9, 385\u2013392 (1990)","journal-title":"Combinatorica"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09935-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-019-09935-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09935-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T21:56:19Z","timestamp":1721598979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-019-09935-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["9935"],"URL":"https:\/\/doi.org\/10.1007\/s00224-019-09935-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2019,8,10]]},"assertion":[{"value":"10 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}